import Control.Applicative

main = do
    getLine
    a <- map read . words <$> getLine
    print $ solve a

solve :: [Integer] -> Integer
solve list = foldl (\acc elem -> acc + (f 0 elem)) 0 list

f ans n = if r == 0 
          then f (ans+1) q
          else ans
            where (q,r) = divMod n 2