n = int(eval(input()))

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



res = 0

for i in range(n):

    if a[i] % 2 == 0:

        k = a[i]

        while k % 2 == 0:

            k //= 2

            res += 1



print(res)

import sys



sys.setrecursionlimit(10 ** 7)

f_inf = float('inf')

mod = 10 ** 9 + 7





def resolve():

    n = int(eval(input()))

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



    even = [A[i] for i in range(n) if A[i] % 2 == 0]



    res = 0

    for number in even:

        while number % 2 == 0:

            res += 1

            number //= 2



    print(res)





if __name__ == '__main__':

    resolve()

n = int(eval(input()))
a = list(map(int, input().split()))
res = 0
for i in range(n):
    if a[i] % 2 == 0:
        k = a[i]
        while k % 2 == 0:
            k //= 2
            res += 1
print(res)

import sys

sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7


def resolve():
    n = int(eval(input()))
    A = list(map(int, input().split()))
    even = [A[i] for i in range(n) if A[i] % 2 == 0]
    res = 0
    for number in even:
        while number % 2 == 0:
            res += 1
            number //= 2
    print(res)


if __name__ == "__main__":
    resolve()

-n = int(eval(input())) -a = list(map(int, input().split())) -res = 0 -for i in range(n): -    if a[i] % 2 == 0: -        k = a[i] -        while k % 2 == 0: -            k //= 2 +import sys + +sys.setrecursionlimit(10**7) +f_inf = float("inf") +mod = 10**9 + 7 + + +def resolve(): +    n = int(eval(input())) +    A = list(map(int, input().split())) +    even = [A[i] for i in range(n) if A[i] % 2 == 0] +    res = 0 +    for number in even: +        while number % 2 == 0: -print(res) +            number //= 2 +    print(res) + + +if __name__ == "__main__": +    resolve()