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()))
ans=10**9
for i in range(n):
  cnt=0
  x=i
  while x%2!=0:
    cnt+=1
    x/=2
  ans=min(ans, cnt)
print(ans)
n=int(input())
a=list(map(int,input().split()))

def c():
    loop=0
    while True:
        for i in range(n):
            ai=a[i]
            if ai%2==0:
                a[i]=ai//2
            else:
                return loop
        loop+=1

print(c())