import Control.Monad

countDivision :: Integer -> [Integer] -> Integer
countDivision count a
  | all even a = countDivision (count+1) (map (\n -> n `quot` 2) a)
  | otherwise = count

main :: IO ()
main = do
  n <- readLn
  a <- replicateM n (readLn :: IO Integer)
  putStrLn $ show $ countDivision 0 a
