There are N positive integers written on a blackboard: A_1, ..., A_N.  Snuke can perform the following operation when all integers on the blackboard are even:    * Replace each integer X on the blackboard by X divided by 2.  Find the maximum possible number of operations that Snuke can perform.
n = int(input())
a = []
A = input().split()
f = False
for i in range(n):
    a.append(int(A[i]))
    if int(A[i]) % 2 != 0:
        f = True
ans = 0

if f:
    print(ans)
else:
    
    
    while True:
        print (a)
        for i in range(len(a)):
            nx = int(a[i]) / 2.0
            if nx % 2 != 0:
                f = True
            a[i] = nx
        if f:
            print (a)
            break
        else:
            ans += 1
    print(ans)
    ##3
    ##1: 8 12 40
    ##2: 4 6 20
    ##3: 2 3 10
n = int(input())
a = []
A = input().split()
f = False
for i in range(n):
    a.append(int(A[i]))
    if int(A[i]) % 2 != 0:
        f = True
ans = 0

if f:
    print(ans)
else:
    while True:
        #print (a)
        for i in range(len(a)):
            nx = int(a[i])
            if nx % 2 != 0:
                f = True
            a[i] = nx / 2
        if f:
            #print (a)
            break
        else:
            ans += 1
    print(ans)