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 =list(map(int,input().split()))
i =0
cnt = 0
while "loop":
    if N[i] % 2 !=  0 :
        break
    else:
        N[i]= N[i] / 2
        i+=1
        cnt+=1
        if i==len(N) :
            i=0
print(cnt)

import math
n = input()
a = list(map(int, input().split()))
b  = 0
cnt = 0
while "loop":
    for num in a:
        if num % 2 == 1:
            b= 1
    if  b == 0:
            a = [ i	/2 for i in a]
            cnt += 1
    else:
        break
print(cnt)
