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

two = [0] * n

for i in range(n):
        while a[i]%2 == 0 :
                two[i] += 1
                a[i] = a[i] / 2
print(max(two))
n = int(input())
a = list(map(int, input().split()))

two = [0] * n

for i in range(n):
        while a[i]%2 == 0 :
                two[i] += 1
                a[i] = a[i] / 2
print(min(two))