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()))

for a in A:
    print(a)
n = int(input())
A = list(map(int, input().split()))

ans = 0
while all(a %2 == 0 for a in A):
    A=[a/2 for a in A]
    ans += 1
print(ans)