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.
input()
c = map(int,input().split())
count = 0
while all(w%2 == 0 for w in c):
    c = [w/2 for s in c]
    count =+ 1
print(count)
input()
c =list(map(int,input().split()))
count = 0
while all(w%2==0 for w in c):
    c=[w/2 for w in c]
    count+=1
print(count)