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())
lis = list(map(int,input().split()))
x = 0
y = 0
while True:
  for i,v in enumerate(lis):
    j = v/2
    if j.is_integer():
      lis[i] = j
      print(lis)
      x += 1
  y += 1
  if not x == n:
    break

print(y)
n = int(input())
lis = list(map(int,input().split()))
y = 0
while True:
    x = 0
    for i,v in enumerate(lis):
        j = v/2
        lis[i] = j
        if j.is_integer():
            x += 1
    if not x == n:
        break
    y += 1

print(y)