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())
numlist = list(map(int,input().split()))
sum=0
temp = 9999999999999
for i in numlist:
	if i % 2 != 0:
		temp =0
		break
	else:
		while i % 2 ==0:
			i //=2
			sum += 1
		print(sum)
		if temp > sum :
			temp = sum
			
print(temp-1)		
	
N = int(input())
numlist = list(map(int,input().split()))
temp = 9999999999999
for i in numlist:
	sum = 0
	if i % 2 != 0:
		temp =0
		break
	else:
		while i % 2 ==0:
			i //= 2
			sum += 1
		if temp > sum :
			temp = sum
			
print(temp)