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.
import math

N = input()
As = map(lambda a: math.log2(int(a)), input().split())

print(int(min(As)))
N = input()
if N == '0':
  print(0)

  
def fac(num):
  if num % 2 == 0:
    return 1 + fac(num / 2)
  else:
    return 0

As = [int(a) for a in input().split()]


Fs = [fac(a) for a in As]

print(int(min(Fs)))