import Control.Applicative
import Control.Monad

main = do
  _ <- getLine
  xs <- (map read . words) <$> getLine
  putStrLn $ show $ solve xs
  
solve :: [Int] -> Int -> Int
solve xs acc =
  if dividable xs then
    solve (map (\n -> n `div` 2) xs) (acc+1)
  else
    acc
    
dividable :: [Int] -> Bool
dividable xs =
  if (flag == 0) then True else False
  where
    flag = foldl (+) $ map (\n -> n `mod` 2) xs