As AtCoder Beginner Contest 100 is taking place, the office of AtCoder, Inc. is decorated with a sequence of length N, a = {a_1, a_2, a_3, ..., a_N}.

Snuke, an employee, would like to play with this sequence.
Specifically, he would like to repeat the following operation as many times as possible:
For every i satisfying 1 \leq i \leq N, perform one of the following: "divide a_i by 2" and "multiply a_i by 3".  
Here, choosing "multiply a_i by 3" for every i is not allowed, and the value of a_i after the operation must be an integer.

At most how many operations can be performed?

-----Constraints-----
 - N is an integer between 1 and 10 \ 000 (inclusive).
 - a_i is an integer between 1 and 1 \ 000 \ 000 \ 000 (inclusive).

-----Input-----
Input is given from Standard Input in the following format:
N
a_1 a_2 a_3 ... a_N

-----Output-----
Print the maximum number of operations that Snuke can perform.

-----Sample Input-----
3
5 2 4

-----Sample Output-----
3

The sequence is initially {5, 2, 4}. Three operations can be performed as follows:
 - First, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {15, 6, 2}.
 - Next, multiply a_1 by 3, divide a_2 by 2 and multiply a_3 by 3. The sequence is now {45, 3, 6}.
 - Finally, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {135, 9, 3}.

Difficulty: introductory

Starter code:

Solutions:
n = int(input())
a = list(map(int,input().split()))

cnt = 0
for i in range(n):
    while True:
        if a[i]%2==0:
            a[i]=a[i]//2
            cnt +=1
        else:
            break
print(cnt)

#!/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(input())
    a = list(map(int,input().split()))
    print(('{}'.format(solve(a))))




def __starting_point():
  main()

__starting_point()

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

ans = 0
for i in a:
    while i % 2 == 0:
        i //= 2
        ans += 1

print(ans)


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

count = 0
for i in range(N):
  for k in range(A[i]):
    if A[i] % 2 == 0:
      A[i] /= 2
      count += 1
    else:
      break
      
print(count)



a =int(input())
b = list(map(int,input().split()))
c = []
ans = 0
while b:
  for i in b:
    if i % 2 ==0:
      c.append(i//2)
  b = c
  ans += len(b)
  c = []
print(ans)

N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in A:
  n = i
  while n % 2 == 0:
    n //= 2
    ans += 1
print(ans)

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

n = int(input())
#n, W = map(int, input().split())
al = list(map(int, input().split()))
#al=[list(input()) for i in range(n)]


def div2(v, a):
    res = 0
    if v == 0:
        return res
    while v % a == 0:
        v = v//a
        res += 1
    return res


ans = 0
for a in al:
    ans += div2(a, 2)
print(ans)


n = int(input())
L = list(map(int,input().split()))
ans = 0

def cal(x):
  if x % 2 != 0: return 0
  return cal(x//2)+1
  
for l in L:
  ans += cal(l)

print(ans)

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



N = int(input())
l = list(map(int,input().split()))

ans = 0
for i in l:
    while i % 2 == 0:
        i /= 2
        ans += 1

print((int(ans)))


input()
print((sum([len(bin(int(a)&-int(a)))-3 for a in input().split()])))


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

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

'''
Created on 2020/08/17

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write

  N=int(pin())
  a=list(map(int,pin().split()))
  ans=0
  for i in a:
    if i%2==1:
      continue
    t=i
    while True:
      if t%2==0:
        t=t//2
        ans+=1
      else:
        break
  print(ans)
  return

main()


# -*- coding: utf-8 -*-

def get_input() -> tuple:
    """
    標準入力を取得する.

    Returns:\n
        tuple: 標準入力
    """
    N = int(input())
    a = list(map(int, input().split()))

    return N, a


def get_divisible_count(x: int) -> int:
    """
    2で何回割ることができるかを返す.

    Args:\n
        x (int): 整数

    Returns:\n
        int: 2で割ることができる回数
    """
    divisible_count = 0
    while x % 2 == 0:
        divisible_count += 1
        x /= 2
    return divisible_count


def main(N: int, a: list) -> tuple:
    """
    メイン処理.

    Args:\n
        N (int): 数列の長さ(1 <= N <= 10000)
        a (list): 数列(1 <= a_i <= 1000000000)

    Returns:\n
        tuple: [description]
    """
    ans = 0
    for n in range(N):
        ans += get_divisible_count(a[n])

    # 結果出力
    print(ans)


def __starting_point():
    # 標準入力を取得
    N, a = get_input()

    # メイン処理
    main(N, a)

__starting_point()

input()
n = 0
for a in map(int,input().split()):
  while a%2 == 0:
    a /= 2
    n += 1
print(n)

N = int(input())
A = list(map(int,input().split()))
ans=0

for i in range(N):
  while A[i]%2 == 0:
    ans += 1
    A[i] = A[i]//2
    
print(ans)

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

for i in a:
    while i%2==0:
        ans+=1
        i=i/2

print(ans)


N = int(input())
A = list(map(int, input().split()))
list1 = []
for i in range(N):
  cnt = 0
  if A[i] % 2 ==1:
    continue
  else:
    while A[i] % 2 == 0:
      cnt += 1
      A[i] = A[i]//2
    list1.append(cnt)

if list1 == []:
  print(0)
elif len(list1) == 1:
  print(list1[0])
else:
  print(sum(list1))

N = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(N):
    while a[i] % 2 == 0:
        a[i] //= 2
        ans += 1
print(ans)

n = int(input())
l = list(map(int, input().split()))
ans = 0
for i in range(n):
    while (l[i] % 2 == 0):
        ans += 1
        l[i] /= 2
print(ans)

N = int(input())
S = list(map(int,input().split()))

def findout(n):
  cnt = 0
  while n % 2 == 0:
    n = n // 2
    cnt += 1
    
  return cnt

A = [findout(s) for s in S]
print((sum(A)))


# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque

def prime_factorization(x):
    """素因数分解"""
    import math
    re = []
    i = 2
    while x != 1:
        if x % i == 0:
            re.append(i)
            x //= i
        else:
            i += 1
            if i > math.sqrt(x):
                re.append(x)
                break
    return re


# from decorator import stop_watch
#
#
# @stop_watch
def solve(N, A):
    ans = 0
    for a in A:
        while a % 2 == 0:
            ans += 1
            a //= 2
    print(ans)


def __starting_point():
    N = int(input())
    A = [int(i) for i in input().split()]
    solve(N, A)

    # # test
    # from random import randint
    # from func import random_str

__starting_point()

n = int(input())
a = list(map(int, input().split()))
cnt = 0

for c in a:
  cnt += format(c, 'b')[::-1].find('1')

print(cnt)

N = int(input())
A = list(map(int,input().split()))
ans = 0

for a in A:
  while a%2==0:
    a//=2
    ans+=1
    
print(ans)

import numpy as np
n = int(input())
a = np.array(list(map(int, input().split())))

ans = 0
for x in a:
    while x % 2 == 0:
        ans += 1
        x //= 2

print(ans)


import math

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

for i in a:
    while True:
        if i %2==0:
            i = i/2
            ans += 1
        else:
            break

print(ans)


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

lst = []
for i in a:
    if i%2 == 0:
        lst.append(i)

def half(x):
    cnt = 0
    for i in range(x):
        if x%2 == 0:
            x = x//2
            cnt += 1
        else:
            break
    return cnt

ans = 0
for i in lst:
    ans += half(i)
    
print(ans)

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

ans = 0
for i in a:
  if i%2 == 0:
    while i%2 == 0:
      ans += 1
      i //= 2
print(ans)

n = int(input())
a_list = list(map(int, input().split()))

num_of_factor_2 = []

for i in range(len(a_list)):
    a_trial = 0
    while a_list[i] % 2 == 0:
        a_list[i] = a_list[i] / 2
        a_trial += 1
    num_of_factor_2.append(a_trial)
    
print(sum(num_of_factor_2))

n = int(input())
lis = list(map(int, input().split()))
ans = 0

for i in range(n):
  con = 0
  if lis[i] % 2 == 0:
    x = lis[i]
    while x % 2 == 0:
      x = int(x / 2)
      con += 1
  ans += con   

print(ans)

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

for i in range(N):
    while a[i] % 2 == 0:
        ans += 1
        a[i] = a[i] // 2

print(ans)

n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
    for j in range(29, 0, -1):
        if a[i] % (2 ** j) == 0:
            ans += j
            break
print(ans)


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

ans = 0
for i in a:
    while i % 32 == 0:
        i //= 32
        ans += 5
    while i % 2 == 0:
        i //= 2
        ans += 1

print(ans)

import sys
import math
from collections import defaultdict, deque, Counter
from copy import deepcopy
from bisect import bisect, bisect_right, bisect_left
from heapq import heapify, heappop, heappush
    
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return map(int, input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def LF(): return list(map(float,input().split()))
def Init(H, W, num): return [[num for i in range(W)] for j in range(H)]

def main():
    N = I()
    L = LI()
    ans = 0
    
    for i in L:
        while True:
            if i % 2==0:
                i //=2
                ans+=1
            else:
                break
    print(ans)

def __starting_point():
    main()
__starting_point()

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

def two_divisor(x):
  cnt = 0
  while x % 2 == 0:
    x //= 2
    cnt += 1
  return cnt

ans = 0
for i in range(N):
  if A[i] % 2 == 0:
    ans += two_divisor(A[i])
    
print(ans)

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

ans = 0
for i in range(n):
    while a[i] % 2 == 0:
        ans += 1
        a[i] = a[i] // 2
        
print(ans)

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


def count_2(x):
    if x % 2 != 0:
        return 0
    else:
        return count_2(x // 2) + 1


ans = 0
for i in range(n):
    ans += count_2(a[i])

print(ans)


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

cnt = 0

for i in range(N):
    x = a[i]
    while(x%2==0):
        x = x // 2
        cnt += 1

print(cnt)

#!/usr/bin/env python3
n=int(input())
cnt=0
a_list=list(map(int,input().split()))
for i in range(n):
    while True:
        if a_list[i]%2==0:
            cnt+=1
            a_list[i]=a_list[i]/2
        else:
            break
    cnt=max(cnt,0)
print(cnt)

N = int(input())
H = list(map(int, input().split()))
ans = 0

for i in range(N):
    while H[i] % 2 == 0:
        ans += 1
        H[i] //= 2
print(ans)

from math import log
n = int(input())
A = list(map(int, input().split()))

ans = 0
cnt = 0
for i in range(n):
    a = A[i]
    while a%2==0:
        a //= 2
        cnt += 1
print(cnt)

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

cnt=0
for n in range(N):
    while True:
        if a[n]%2==0:
            a[n]//=2
            cnt+=1
        else:
            break
print(cnt)

import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in a:
    while i%2==0:
        i//=2
        cnt+=1
print(cnt)

n=int(input())
a=list(map(int,input().split()))
count=0
for i in range(len(a)):
  counter=0
  while 1:
    
    if a[i]%2==0:
      counter+=1
      a[i]=a[i]//2
    else:
      break
  count+=counter
print(count)

n = int(input())
a = list(map(int, input().split()))
c = 0
for x in a:
  while x % 2 == 0:
    c += 1
    x //= 2
print(c)

# coding=utf-8

def __starting_point():
    N = int(input())
    lia = list(map(int, input().split()))

    C = 0
    for i in range(N):
        if lia[i] % 2 ==0:
            tmp = lia[i]
            while tmp % 2 ==0:
                tmp = tmp / 2
                C += 1

    print(int(C))
__starting_point()

def main():
    n = int(input())
    a_lst = list(map(int, input().split()))
    count = 0

    for i in range(n):
        a = a_lst[i]

        while a % 2 == 0:
            count += 1
            a //= 2

    print(count)


def __starting_point():
    main()
__starting_point()

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

c=0

for i in range(n):
  if a[i]%2==0:
    while a[i]%2==0:
      a[i]/=2
      c+=1
    
print(c)

N = int(input())
As = input().split(' ')
As = [int(As[i]) for i in range(N)]
EVEN = 0
for i in range(N):
  if As[i]%2 == 0:
    while As[i]%2 == 0:
      As[i] /= 2
      EVEN += 1
print(EVEN)

N = int(input())
List = list(map(int,input().split()))
counter = 0
for item in List:
  while True:
    if item % 2 == 0:
      counter += 1
      item /= 2
    else:
      break
print(counter)

n = int(input())
nums = list(map(int,input().split()))
count = 0
even = False
for i in range(len(nums)):
    if nums[i] % 2 == 0:
        even = True
    while even:
        if nums[i] % 2 == 0:
            count += 1
            nums[i] = int(nums[i]/2)
        else:
            even = False
print(count)

N =int(input())
A= list(map(int,input().split()))
count=0
for i in range(N):
    if  A[i]%2 !=0:
        continue
    else:
        N =A[i]
        while N %2==0:
            N=N//2
            count+=1
print(count)


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

for i in a:
    while i%2==0:
        ans+=1
        i=i/2

print(ans)


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

ans=0
for i in range(n):
    while 1==1:
        if a[i]%2==0:
            ans+=1
            a[i]/=2
        else:
            break
            
print(ans)

n = int(input())
As = list(map(int, input().split()))
count = 0
for an in As:
    while an %2==0:
        count +=1
        an = an/2
        
print(count)

N=int(input())
A=list(map(int, input().split()))
counter=[]
for num in range(len(A)):
  counter.append(0)
for num in range(len(A)):
  while A[num]%2==0:
    A[num]=A[num]/2
    counter[num]+=1
print((sum(counter)))


# -*- coding: utf-8 -*-
"""
Created on Fri Sep 18 10:08:18 2020

@author: liang
"""
N = int(input())
A = [int(x) for x in input().split()]
ans = 0
for a in A:
    while a%2 == 0:
        a //= 2
        ans += 1
print(ans)

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

M = []
for i in A:
    if i % 2 == 0:
        M.append(i)

ans = 0
for j in M:
    while j%2 == 0:
        j //= 2
        ans += 1

print(ans)


n=int(input())
a=list(map(int,input().split()))
count=0
w=False
for i in range(n):
  if a[i]%2==0:
    w=True
  while w:
    count+=1
    a[i]=a[i]//2
    if a[i]%2!=0:
      w=False
print(count)

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

ans = 0
for i in range(N):
    while A[i] % 2 == 0:
        ans += 1
        A[i] = A[i]/2

print(ans)


#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
import numpy as np

def main():
    n = int(input())
    numbers=list(map(int,input().split()))
    numbers=np.array(numbers)
    count=0
    
    if np.all(numbers%2==1):
        print(0)
        return
    while True:
        if np.all(numbers%2==1)==True:
            break
        else:
            idx=np.where(numbers%2==0)
            count+=np.count_nonzero(numbers%2==0)
            numbers[idx]=numbers[idx]//2
    print(count)

def __starting_point():
    main()
__starting_point()

def mai():
    input()
    t = list(map(int, input().split()))
    t.sort(reverse=True)
    count = 0
    val = t[0]
    tmp_count = 0
    for v in t:
        while v % 2 == 0:
            v //= 2
            tmp_count += 1
    print(tmp_count)


def __starting_point():
    mai()
__starting_point()

n = int(input())
a = [int(x) for x in input().split()]

def check(p):
  c = 0
  while p % 2 == 0:
    c += 1
    p //= 2
  return c

res = 0
for i in range(n):
  res += check(a[i])
print(res)


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

# a_i /2 or x3
# すべてint, すべてx3はだめ

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

# 素因数の中に2がいくつ入っているか。
fact_list = []
for item in a:
    fact_list += prime_factorize(item)

print((fact_list.count(2)))
    


import sys

def factorize(n):
    if n == 2:
        return [2]
    b = 2
    fct = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            fct.append(b)
        break
    return fct


input = sys.stdin.readline

n = int(input())
a_list = list(map(int, input().split()))

count_2 = 0
for a in a_list:
    count_2 += len(factorize(a))

print(count_2)


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

ans=0
for a in A:
    while a%2==0:
        a=a//2
        ans+=1
print(ans)

def twos(m):
	rt = 0
	while m%2 == 0:
		m //= 2
		rt += 1
	return rt

n = int(input())
a = list(map(int,input().split()))
ans = 0
for j in a:
	ans += twos(j)
print(ans)

N = int(input())
A = list(map(int, input().split()))
ans = 0

for i in range(N):
    while A[i] % 2 == 0:
        A[i] = A[i]//2
        ans += 1

print(ans)


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

ans = 0

for a in A:
    ans_ = 0
    while a % 2 == 0:
        a //= 2
        ans_ += 1
    ans += ans_

print(ans)

N = int(input())
N_List = list(map(int,input().split()))
cnt = 0
while len(N_List) != 0:
    N_List = [i//2 for i in N_List if i % 2 == 0].copy()
    cnt += len(N_List)
print(cnt)

N,*A = map(int,open(0).read().split())

cnt = 0
for a in A:
  for n in range(1,31):
    if a%(2**n)!=0:
      cnt += n-1
      break
print(cnt)

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

cnt = 0

for i in range(N):
    if a[i]%2 == 0:
        while a[i]%2 == 0:
            cnt += 1
            a[i] /= 2

print(cnt)

N=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(N):
    while a[i]%2==0:
        ans+=1
        a[i]>>=1
print(ans)


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

ans = 0
for i in range(n):
  if a[i]%2==0:
    
    while a[i]%2==0:
      a[i] //= 2
      ans += 1
      
print(ans)

N = int(input())
a = list(map(int,input().split()))
cnt = 0
for x in a:
    while x % 2 == 0:
        x //= 2
        cnt += 1
print(cnt)

n = int(input())
s = list(map(int, input().split()))
ans = 0
for i in range(n):
  while s[i] %2 == 0:
    s[i] /= 2
    ans += 1

print(ans)

N = int(input())
lsa = list(map(int,input().split()))
ans = 0
for i in range(N):
    a = lsa[i]
    while a % 2 == 0:
        ans += 1
        a = a//2
print(ans)

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

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

ans = 0

for i in range(N):
    while a[i]%2 == 0:
        a[i] = a[i]//2
        ans += 1

print(ans)

n = int(input())
L = list(map(int,input().split()))

ans = 0
for i in range(n):
    cnt = 0
    while True:
        if L[i]%2 == 0:
            cnt +=1
            L[i]//=2
        else:
            break
    ans +=cnt
print(ans)

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


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


ans = 0
for i in range(n):
    ans += count_2(a[i], 0)

print(ans)


n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n):
  while True:
    if a[i]%2==0:
      ans+=1
      a[i]//=2
    else:
      break

print(ans)

N = int(input())
a = list(map(int,input().split()))
s=0
for i in range(N):
  while(True):
    if a[i]==0:
      break 
    if a[i]%2==0:
      a[i]=a[i]//2
      s=s+1
      #print(i,a[i],s)
    else:
      break
print(s)

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

C=[0]*n 
for i in range(n):
    cnt=0
    while A[i]%2==0:
        cnt+=1
        A[i]//=2
    C[i]=cnt 
print(sum(C))

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

count = 0
for i in a:
    if i%2 == 0:
        while i%2 == 0:
            i //= 2
            count += 1
print(count)

input()
print((sum([len(bin(a&-a))-3 for a in map(int,input().split())])))


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

s = 0
for x in a:
    k = 0
    while x % 2 == 0:
        k += 1
        x //= 2
    s += k

print(s)

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


n=int(input())

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

print(ans)


n= int(input())
a= map(int,input().split())
c=0
for i in a:
    while i%2==0:
        i=i//2
        c+=1
print(c)

# -*- coding: utf-8 -*-
# 標準入力を取得
N = int(input())
a = list(map(int, input().split()))

# 求解処理


def get_divisible_count(x: int) -> int:
    divisible_count = 0
    while x % 2 == 0:
        divisible_count += 1
        x /= 2
    return divisible_count


ans = 0
for n in range(N):
    ans += get_divisible_count(a[n])

# 結果出力
print(ans)


def main():
    N = int(input())
    A = list(map(int, input().split()))
    ans = 0
    for a in A:
        for i in range(1, 31):
            if a%(2**i) != 0:
                ans += i-1
                break
    print(ans)

def __starting_point():
    main()

__starting_point()

import sys
input = sys.stdin.readline

n = int(input())
A = list(map(int,input().split()))
for i in range(n):
    d = 0
    while A[i] > 0:
        if A[i] % 2 == 0:
            d += 1
            A[i] = A[i] // 2
        else:
            break
    A[i] = d
print(sum(A))

n = int(input())
a = list(map(int, input().split()))
num = 0
for i in a:
    if i%2 == 0:
        t = i
        z = 'YES'
        while z == 'YES':
            if t%2 == 0:
                num += 1
                t /= 2
            else:
                z == 'NO'
                break
print(num)

n = int(input())
a = list(map(int,input().split()))
ans = 0
for v in a:
  cnt = 0
  while v%2==0:
    v //= 2
    cnt += 1
  ans += cnt
print(ans)

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

count = 0
for i in a:
  count += len(bin(i)) - bin(i).rfind("1") - 1

print(count)


n=int(input())
a=list(map(int,input().split()))
p = 1
cnt = 0
for i in a:
        while i % 2 == 0:
                i //=2
                cnt +=1
print(cnt)

# coding: utf-8


def main():
    _ = int(input())
    A = list(map(int, input().split()))
    ans = 0

    for a in A:
        while a % 2 == 0 and a > 1:
            ans += 1
            a >>= 1

    print(ans)

def __starting_point():
    main()

__starting_point()