import sys

def max_power_of_2(num):
    m = 0
    while num % 2 == 0:
        num //= 2
        m += 1
    return m

if __name__ == "__main__":
    n = int(input())
    nums = [int(i) for i in input().split(' ')]
    
    all_weiyu_results = []
    for i in range(2 ** n):
        comb = bin(i)[2:].zfill(n)
        
        weiyus = []
        for j in range(n):
            if comb[j] == '1':
                weiyus.append(nums[j])

        if len(weiyus) == 0:
            continue
        elif len(weiyus) == 1:
            all_weiyu_results.append(max_power_of_2(weiyus[0]))
        else:
            result = weiyus[0]
            for k in weiyus[0]:
                result = result & k
            all_weiyu_results.append(max_power_of_2(result))
    print(max(all_weiyu_results))