import numpy as np

def IntLog2(N):

    k = 0

    while N%2 == 0:

        k += 1

        N /= 2

    return k



N = input()

inputArray = list(map(int, input().split()))

Log2_inputArray = [IntLog2(n) for n in inputArray]

print(min(Log2_inputArray))
def SolveABC081B(array):

    print(max(j for j in range(32) if all(i % 2**j == 0 for i in array)))

    

eval(input())

inputArray = list(map(int, input().split()))

SolveABC081B(inputArray)
import numpy as np


def IntLog2(N):
    k = 0
    while N % 2 == 0:
        k += 1
        N /= 2
    return k


N = input()
inputArray = list(map(int, input().split()))
Log2_inputArray = [IntLog2(n) for n in inputArray]
print(min(Log2_inputArray))

def SolveABC081B(array):
    print(max(j for j in range(32) if all(i % 2**j == 0 for i in array)))


eval(input())
inputArray = list(map(int, input().split()))
SolveABC081B(inputArray)

-import numpy as np +def SolveABC081B(array): +    print(max(j for j in range(32) if all(i % 2**j == 0 for i in array))) -def IntLog2(N): -    k = 0 -    while N % 2 == 0: -        k += 1 -        N /= 2 -    return k - - -N = input() +eval(input()) -Log2_inputArray = [IntLog2(n) for n in inputArray] -print(min(Log2_inputArray)) +SolveABC081B(inputArray)