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())
z = list(map(int,input().split()))

def half(n,z):
	exist_odd = False
	count = 0
	while True: 
		for i in z:
			if i % 2 != 0:
				exist_odd = True

		if exist_odd:
			print(count)
			break
		
		for i in z:		
			i /= 2
		
		count += 1

half(n,z)

n = int(input())
z = list(map(int,input().split()))

def half(n,z):
	existodd = 0
	count = 0
	while True: 
		for i in z:
			if i % 2 != 0:
				existodd = 1

		if existodd:
			print(count)
			break
		
		for i in range(n):		
			z[i] /= 2
		
		count += 1
	
half(n,z)
