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()))
k = 0

while all(i//2 == 0 for i in A):
    A = [i/2 for i in A]
    k += 1

print(k)
N = int(input())
A = list(map(int,input().split()))
k = 0

while all(i%2 == 0 for i in A):
    A = [i/2 for i in A]
    k += 1

print(k)