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())  
num_list =  list(map(int, input().split()))
    
count = 0
actual_count = 0
w = 0
new_list = []
while (w == 0):
    for i in range(N):
        a = num_list[i]
        
        b = int(a) % 2 
        if (b == 0):
            count += 1
    if (count == N):
        for n in range(N):
            a = num_list[n]
            b = int(a) / 2
            new_list.append(b)
        num_list = []
        for l in range(N):
            a = new_list[l]
            num_list.append(a)
            actual_count += 1
        
    else:
        w = 1
        
print(actual_count)
N = int(input())  
num_list =  list(map(int, input().split()))
    
count = 0
actual_count = 0
w = 0
new_list = []
while (w == 0):
    count = 0
    for i in range(N):
        a = num_list[i]
        
        b = int(a) % 2 
        if (b == 0):
            count = count + 1
    if (count == N):
            new_list =[]
            for n in range(N):
                a = num_list[n]
                b = int(a) / 2
                new_list.append(b)
            num_list = []
            for l in range(N):
                a = new_list[l]
                num_list.append(a)
                
            
            actual_count += 1
    else:
        w = 1
        
        
print(actual_count)