#!/bin/python3

import math
import os
import random
import re
import sys



if __name__ == '__main__':
    n = int(input().strip())
    binary=[]
    while n>0:
        remainder=n%2
        if remainder==0:
            n=n/2
        else:
            n=(n-1)/2
        binary.append(remainder)
    binary.reverse()

    maxsum=1
    k=[]

    for i in range(len(binary)-1):
        if (binary[i]==binary[i+1]):
            maxsum=maxsum+1
        else:
            k.append(maxsum)
            maxsum=1
        if (binary[len(binary)-2]==binary[len(binary)-1]):
            k.append(maxsum)
    print(max(k))

def to_binary(n):
    if n == 0:
        return "0"
    elif n == 1:
        return "1"
    else:
        return to_binary(n//2) + str(n % 2)

def cont(string, curr=0, res=0):
    if not string:
        return res
    if string[0]=='1':
        curr += 1
    else:
        res = max(curr, res)
        curr = 0
    res = max (curr, res)
    return cont(string[1:], curr, res)



    
def main():
    n = int(input().strip())
    str1 = to_binary(n)
    larg = int(len(str1))
    #print (str1)
    print(cont(str1))    
    
    return 0

if __name__ == '__main__':
    main()

int main()
{
    int n = parse_int(ltrim(rtrim(readline())));
    int consec = 0;
    int max = 0;
    while(n>0){
        if ((n%2)==1) {
            consec++;
        }
        else{
            if (consec>max) max =consec;
            consec = 0;
        }
        n /= 2;
    }
    consec>max ? printf("%d \n", consec):printf("%d \n", max);
    
    return 0;
}

if __name__ == '__main__':
    n = int(input().strip())
    s_group = bin(n)[2:].split('0')
    n_group = [len(x) for x in s_group]
    
    print(max(n_group))