N = int(eval(input()))

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



def divide_two(x,c=0):

  if x % 2 == 1:

    return c

  else:

    return divide_two(x//2,c+1)



b = (divide_two(x) for x in a)



print((sum(list(b))))
#!/usr/bin/env python3

# import sys

# sys.recursionlimit(10**7)

from functools import reduce



def divideCount(k):

    cnt = 0

    while k % 2 == 0:

        k //= 2

        cnt += 1

    return cnt



def solve(a):

    return sum(

        map(

            divideCount,a

        )

    )





def main():

    _ = int(eval(input()))

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

    print(('{}'.format(solve(a))))









if __name__ == '__main__':

  main()

N = int(eval(input()))
a = list(map(int, input().split()))


def divide_two(x, c=0):
    if x % 2 == 1:
        return c
    else:
        return divide_two(x // 2, c + 1)


b = (divide_two(x) for x in a)
print((sum(list(b))))

#!/usr/bin/env python3
# import sys
# sys.recursionlimit(10**7)
from functools import reduce


def divideCount(k):
    cnt = 0
    while k % 2 == 0:
        k //= 2
        cnt += 1
    return cnt


def solve(a):
    return sum(map(divideCount, a))


def main():
    _ = int(eval(input()))
    a = list(map(int, input().split()))
    print(("{}".format(solve(a))))


if __name__ == "__main__":
    main()

-N = int(eval(input())) -a = list(map(int, input().split())) +#!/usr/bin/env python3 +# import sys +# sys.recursionlimit(10**7) +from functools import reduce -def divide_two(x, c=0): -    if x % 2 == 1: -        return c -    else: -        return divide_two(x // 2, c + 1) +def divideCount(k): +    cnt = 0 +    while k % 2 == 0: +        k //= 2 +        cnt += 1 +    return cnt -b = (divide_two(x) for x in a) -print((sum(list(b)))) +def solve(a): +    return sum(map(divideCount, a)) + + +def main(): +    _ = int(eval(input())) +    a = list(map(int, input().split())) +    print(("{}".format(solve(a)))) + + +if __name__ == "__main__": +    main()