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 = [int(i) if int(i)%2==0 else 1 for i in input().split()]

count = 0
while(not(1 in A)):
    print(A)
    A = [i/2 if (i/2)%2==0 else 1 for i in A]
    count += 1
    
print(count)
N = int(input())
A = [int(i) if int(i)%2==0 else 1 for i in input().split()]

count = 0
while(not(1 in A)):
    A = [i/2 if (i/2)%2==0 else 1 for i in A]
    count += 1
    
print(count)