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 = list(map(int, input().split()))
count = 0


for j in range(1,1000000):
    odd_flag = True

    while odd_flag:
        for i in range(0,len(A)): 
            if A[i] % 2 == 0:
                A[i] = A[i]/2
            else:
                odd_flag = False


count+=1


print(count)
def divisible(n):
    ans = 0
    while n % 2 == 0:
        n /= 2
        ans +=1
    return ans

N = int(input())

A = list(map(int, input().split()))

ans = min(map(divisible,A))
print(ans)
