from sys import stdin

import fractions



n = int(stdin.readline().rstrip())

li = list(map(int,stdin.readline().rstrip().split()))





def prime_factorize(n):

    a = []

    while n % 2 == 0:

        a.append(2)

        n //= 2

    f = 3

    while f * f <= n:

        if n % f == 0:

            a.append(f)

            n //= f

        else:

            f += 2

    if n != 1:

        a.append(n)

    return a



point = 0



for i in li:

    lin = prime_factorize(i)

    point += lin.count(2)



print(point)
n = int(eval(input()))

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



point = 0



for i in li:

    while i%2 == 0:

        i //= 2

        point += 1



print(point)
from sys import stdin
import fractions

n = int(stdin.readline().rstrip())
li = list(map(int, stdin.readline().rstrip().split()))


def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a


point = 0
for i in li:
    lin = prime_factorize(i)
    point += lin.count(2)
print(point)

n = int(eval(input()))
li = list(map(int, input().split()))
point = 0
for i in li:
    while i % 2 == 0:
        i //= 2
        point += 1
print(point)

-from sys import stdin -import fractions - -n = int(stdin.readline().rstrip()) -li = list(map(int, stdin.readline().rstrip().split())) - - -def prime_factorize(n): -    a = [] -    while n % 2 == 0: -        a.append(2) -        n //= 2 -    f = 3 -    while f * f <= n: -        if n % f == 0: -            a.append(f) -            n //= f -        else: -            f += 2 -    if n != 1: -        a.append(n) -    return a - - +n = int(eval(input())) +li = list(map(int, input().split())) -    lin = prime_factorize(i) -    point += lin.count(2) +    while i % 2 == 0: +        i //= 2 +        point += 1