Problem:
 Score: 300 points    Problem Statement  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 1 3
5 2 4      Sample Output 1 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} .        Sample Input 2 4
631 577 243 199      Sample Output 2 0  No operation can be performed since all the elements are odd. Thus, the answer is 0 .       Sample Input 3 10
2184 2126 1721 1800 1024 2528 3360 1945 1280 1776      Sample Output 3 39

Solution (Python):
N = int(input())
an = list(map(int, input().split()))

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

Solution (Python):
_,a=open(0);print(sum(bin(int(x))[::-1].index('1')for x in a.split()))

Solution (Python):
N = int(input())
a = map(int,input().split())

def counter(x):
    num = 0
    while x%2==0:
        num += 1
        x /= 2
    return num

s = [counter(i) for i in a]
print(sum(s))

Solution (Python):

import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
N = int(stdin.readline())
nums = tuple(li())
total = 0
for n in nums:
    while n % 2 == 0:
        total += 1
        n = n / 2
print(total)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N = INT()
a = LIST()
count = 0
flag = 0
"""
while flag == 0:
	print(a)
	for i in range(N):
		if a[i] % 2 == 0:
			a[i] = int(a[i]/2)
			count += 1
			break
	else:
		flag = 1
"""
for i in a:
    while i % 2 == 0:
        count += 1
        i /= 2
print(count)

Solution (Python):
import sys

input = sys.stdin.readline


def func(x):
    count = 0
    while(x % 2 == 0):
        x = int(x / 2)
        count += 1
    return (count)


n = int(input())

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


a_even = [x for x in a if x % 2 == 0]

lis = [func(x) for x in a]



print(sum(lis))

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

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = 1
ans = 0
for i in range(N):
    for j in range(32, 0, -1):
        if A[i] % (2**j) == 0:
            ans += j
            A[i] = A[i] / (2**j)
print(ans)

Solution (Python):
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] /= 2
            cnt += 1
        else:
            break
print(str(cnt))

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

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

Solution (Python):
N = int(input())
L = list(map(int,input().split()))
cnt = 0
for i in range(N):
  k = L[i]
  while k%2 == 0:
    cnt += 1
    k = k//2
print(cnt)

Solution (Python):
from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]  
def LF(): return [float(x) for x in sys.stdin.readline().split()]  
def LS(): return sys.stdin.readline().split()  
def MI(): return map(int, sys.stdin.readline().split())  
def II(): return int(sys.stdin.readline())  
def IS(): return input()  
def P(x): return print(x)
def C(x): return Counter(x)
def GCD_LIST(numbers):  
    return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers):  
    return reduce(LCM, numbers)
def LCM(m, n):
    return (m * n // fractions.gcd(m, n))


n = II()
a = LI()
counter = 0
for i in a:
    while(i % 2 == 0):
        i //= 2
        counter += 1
P(counter)

Solution (Python):
def count(n_str):
    n = int(n_str)
    c = 0
    while n % 2 == 0:
        c += 1
        n = n / 2
    return c


N = int(input())
print(sum(list(map(count, input().split()))))

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

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

print(ans)

Solution (Python):


import re

n = int(input())

a = input()
a = re.split(" ",a)

count = 0
for i in range(len(a)):
    if(int(a[i]) % 2 == 0):
        while(int(a[i]) > 1):
            a[i] = int(a[i])/2
            count += 1
            if(int(a[i]) % 2 != 0):
                break;
    else:
        pass

print(count)

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

cnt = 0

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

print(cnt)

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    s = S()
    c = s.count("0")
    print(2*min(c,len(s)-c))
    return


def B():
    n = I()
    h = LI()
    ans = 0
    m = min(h)
    while m:
        ans += m
        k = max(h)
        for i in range(n):
            if h[i] >= m:
                h[i] -= m
                if h[i]:k = min(k,h[i])
            else:break
        m = k
    print(ans)
    return


def C():
    n,k = LI()
    x = LI()
    ans = float("inf")
    j = bisect.bisect_left(x,0)
    if n == 1:
        print(abs(x[0]))
        quit()
    if j < n:
        if x[j] == 0:
            k -= 1
            x.pop(j)
            n -= 1
    for i in range(n):
        if i < j:
            if abs(i-j) > k:continue
            elif abs(i-j) == k:ans = min(ans,abs(x[i]))
            elif k+i-1 < n:
                ans = min(ans,abs(x[i])+x[k+i-1]-x[i])
        else:
            if abs(i-j)+1 > k:continue
            elif abs(i-j)+1 == k:ans = min(ans,x[i])
            elif i-k+1 >= 0:
                ans = min(ans,abs(x[i])+x[i]-x[i-k+1])

    print(ans)
    return


def D():
    n = I()
    a = LI()
    ans = 0
    p = [1<<i for i in range(100)]
    for i in range(n):
        l = 0
        r = 100
        while r-l > 1:
            m = (l+r)//2
            if a[i]%p[m] == 0:
                l = m
            else:
                r = m
        ans += l
    print(ans)
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


def I_():
    return


def J():
    return


if __name__ == "__main__":
    D()

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
def count(i):
  c = 0
  while i%2 != 1:
    i /= 2
    c += 1
  return c

print(sum([count(i) for i in a]))

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

def solve(N):
    fac = 0
    for i in a:
        while True:
            if i % 2 == 0:
                fac = fac + 1
                i = i//2
            else:
                break
    return fac

print(solve(N))

Solution (Python):



N = int(input())
A = list(map(int, input().rstrip().split(' ')))
    
num_2 = 0
for a in A:
    while True:
        if a % 2 == 0:
            a /= 2
            num_2 += 1
        else:
            break
        
print(num_2)

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

Solution (Python):



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]=a[i]//2
        else: break
print(ans)

Solution (Python):
a=int(input())
b=list(map(int,input().split()))
c=0

for i in b:
  for j in range(30):
    if i%2==0:
      c+=1
      i//=2
    else:
      break
print(c)

Solution (Python):
N = int(input())
As = map(int, input().split())

total = 0
for a in As:
    while a % 2 == 0:
        a //= 2
        total += 1

print(total)

Solution (Python):
N = int(input())
a = [int(i) for i in input().split()]

ans = 0
for i in a:
    count = 0
    j = i
    while j >= 0:
        if j % 2 == 0:
            j = int(j/2)
            count += 1
        else:
            break
    ans += count

print(ans)

Solution (Python):


N =int(input())
a =[int(j) for j in input().split()]
ans = 0
for i in range(N):
    tmp=0
    for j in range(1,30):
        if a[i]%(2 ** j)==0:
            tmp = max(tmp,j)
    ans +=tmp
print(ans)

Solution (Python):
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit

import heapq
import itertools
import operator


inf = float('inf')



N = 0
A = []


def set_inputs():
    global N, A
    N = get_int()
    A = get_li()
    return


def main():
    setrecursionlimit(100000)
    set_inputs()
    ans = 0
    for a in A:
        while a % 2 == 0:
            a //= 2
            ans += 1
    print(ans)
    return


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_li():
    return [int(i) for i in input().split()]


def get_lf():
    return [float(f) for f in input().split()]


def get_lc():
    return list(input().strip())


def get_data(n, types):
    if len(types) == 1:
        return [types[0](input()) for _ in range(n)]
    return zip(*(
        [t(x) for t, x in zip(types, input().split())]
        for _ in range(n)
    ))


if __name__ == '__main__':
    main()

Solution (Python):
def two_division(x):
  count=0
  while x%2==0:
    count+=1
    x//=2
  return count
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in a:
  ans+=two_division(i)
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
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)

Solution (Python):
N = int(input())
a = [int(i) for i in input().split()]
ans = 0
for x in a:
    while x%2 == 0:
        x = x//2
        ans += 1
print(ans)

Solution (Python):
flag=True
n=int(input())
A=list(map(int,input().split()))
cnt=0
while flag:
  ls=[]
  tmp=False
  for a in A:
    if a%2==0:
      tmp=True
      cnt+=1
      ls.append(a//2)
  A=ls
  if tmp==False:
    flag=False
print(cnt)

Solution (Python):
N=int(input())
A=[int(x) for x in input().split()]
ans=0
for i in range(N):
  while A[i]%2==0:
    A[i]//=2
    ans+=1
print(ans)

Solution (Python):
_ = int(input())
A = [ int(x) for x in input().split() ]

ans = 0

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

print(ans)

Solution (Python):
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)

Solution (Python):
N = int(input())
a = list(map(int,input().split()))
c = 0
for i in range(N):
    j = 2
    while True:
        if a[i] % j != 0:
            break
        j *= 2
        c += 1
print(c)

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

list_even = [n for n in A if n % 2 == 0]

cnt_all = 0
for even in list_even:
  cnt_by_even = 0
  while even % 2 == 0:
    even = even / 2
    cnt_by_even += 1
  
  cnt_all += cnt_by_even
  
print(cnt_all)

'''考え方
偶数の値だけを取得し、何回２で割り算することができるか、を計算する。
'''

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

Solution (Python):
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)

Solution (Python):
n = int(input())
a = [int(item) for item in input().split()]

twos = 0
for item in a:
  while item % 2 == 0 and item is not 0:
    item //= 2
    twos += 1
    
print(twos)

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

Solution (Python):

N=int(input())
ListA=[]
A=input()
ListA=A.split()
ListB=[]
for i in range(0,len(ListA),1):
  ListB.append(int(ListA[i]))
c=0
S=0
for i in range(0,len(ListB),1):
  A=int(ListB[i])
  while A%2==0:
    A=A/2
    c+=1
  else:
    S+=c
    c=0
print(S)

Solution (Python):
N = int(input())
a = [int(x) for x in input().split()]
p = [0]*N

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

print(sum(p))

Solution (Python):

import sys
input = sys.stdin.readline

def counter(n):
  count1 = 0
  while(1):
    if(n%2 == 1):
      break
    else:
      n = n//2
      count1 += 1
  return count1

N = int(input())
A = list(map(int,input().split()))
count = 0
for a in A:
  count += counter(a)

print(count)

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

def mod2(a):
  ret = 0
  while a%2==0:
    ret +=1
    a=a//2
  return ret

print(sum([mod2(a) for a in A]))

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

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

ans = 0

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

Solution (Python):
def div_2(cnt, num):
  if num % 2 != 0:
    return cnt
  else:
    cnt += 1
    return div_2(cnt, int(num / 2))

cnt = 0
n = int(input())
a_lst = input().split()
for elem in a_lst:
  cnt = div_2(cnt, int(elem))

print(cnt)

Solution (Python):
N=int(input())
list=map(int,input().split())
A=0
for number in list :
    while number%2==0 :
        number /=2
        A+=1
print(A)

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()]
count = 0
for i in a:
    while (i % 2 == 0):
        count += 1
        i = i // 2
print(count)

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

Solution (Python):
N = int(input())
ai = list(map(int, input().split()))

count = 0

for a in ai:
    while a % 2 == 0:
        count += 1
        a /= 2

print(count)

Solution (Python):
n = int(input())
a = [int(i) for i in input().split(" ")]

def count_two(n):
    r = 0
    while n % 2 == 0:
        n = n // 2
        r += 1
    return r

s = 0
for i in range(0, n):
    s += count_two(a[i])
    
print(s)

Solution (Python):
def factor2(num):
    counter = 0
    while num % 2 == 0:
        num = num//2
        counter += 1
    return counter


N = int(input())
alist = list(map(int, input().split()))
ans = 0
for num in alist:
    ans += factor2(num)
print(ans)

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
def count_two(num):
    flag=0
    count=0
    while flag==0:
        if num%2==0:
            count+=1
            num=int(num/2)
        else:
            flag=1
    return count

ans=0
for temp in A:
    ans+=count_two(temp)
print(ans)

Solution (Python):
N = int(input())
a = [int(_) for _ in input().split()]
Res = 0

for i in a:
    cnt = 0
    for j in range(1, 31):
        if i % 2**j == 0 and i // 2**j != 0:
            cnt += 1
        else:
            Res += cnt
            break

print(Res)

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy
from operator import itemgetter

def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")

def ip():
    return int(input())

rem = pow(10,9)+7

n = ip()                                     

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








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

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)

N = I()
A = LI()

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

print(result)

Solution (Python):
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)

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

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
count = 0
for n in a:
    while 1:
        if n % 2 == 0:
            count += 1
            n = n // 2
        else:
            break
print(count)

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

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
res = 0

for i in range(len(a)) :
  while(a[i]%2 == 0) :
    res += 1
    a[i] = int(a[i]/2)

print(res)

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

Solution (Python):
n = int(input())
lst = list(map(int, input().split()))

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

Solution (Python):
N=int(input())
a=list(map(int,input().split()))
count=0
for i in a:
    while i%2==0:
        i/=2
        count+=1
print(count)

Solution (Python):
N = int(input())
Ai = list(map(int, input().split()))

def calc(n):
    ret = 0
    while n % 2 == 0:
        ret += 1
        n //= 2
    return ret

count = [calc(a) for a in Ai]
m = sum(count)
print(m)

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

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

Solution (Python):
def solve(a):
    sum = 0
    while a % 2 == 0:
        a //= 2
        sum += 1
    return sum


N = int(input())
A = [int(i) for i in input().split()]
ans = [solve(a) for a in A]
print(sum(ans))

Solution (Python):
n = int(input())

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

res = 0
for num in l:
    while num!=0:
        if (num & 1)==0:
            res += 1
            num >>= 1
        else:
            break
print(res)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
answer = 0

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

print(answer)

Solution (Python):
N=input()
lst=map(int,input().split())
ans=0
for i in lst:
	while i%2 == 0:
		i //= 2
		ans += 1
print(ans)

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()]

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

Solution (Python):
def solve(string):
    n, *a = map(int, string.split())
    count = 0
    for _a in a:
        tmp = _a
        while tmp % 2 == 0:
            tmp /= 2
            count += 1
    return str(count)


if __name__ == '__main__':
    print(solve("\n".join([input(), input()])))

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

ans = 0

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

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

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

cnt = 0
for ai in a:
    while ai % 2 == 0:
        ai //= 2
        cnt += 1
print(cnt)

Solution (Python):
N = int(input())

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

n2= 0
for num in A:
    while num%2 == 0:
        n2 += 1
        num /= 2
else:
    print(n2)

Solution (Python):
input = open(0).read

N, *an = map(int, input().split())


def main():
    ans = 0

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

        ans += tmp

    print(ans)
    return


main()

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
j=0
while len(a)!=0:
    a = [i/2 for i in a if i%2==0]
    j +=len(a)
print(j)

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

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

Solution (Python):
import math

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

def bi(num):
    n = 0
    while not num % 2:
        num = num / 2
        n += 1
    return n

print(sum(map(bi, lis)))

Solution (Python):
def num_of_2(x):
    y = 0
    while x%2==0:
        x = x // 2
        y += 1
    return y

n = int(input())
a_list = list(map(int, input().split(" ")))
print(sum([num_of_2(x) for x in a_list]))

Solution (Python):
N = int(input())
lst = list(map(int,input().split() ))
count = 0
for a in lst:
    while a % 2 == 0:
        count += 1
        a = a / 2

print(count)

Solution (Python):
from sys import stdin
N = int(input())
a = [int(x) for x in stdin.readline().rstrip().split()]
ans = 0
for i in range(N):
    while a[i]%2 != 1:
        a[i] = a[i]/2
        ans += 1
print(ans)

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

Solution (Python):
def num2(n: int) -> int:
    """n を素因数分解した時の 2 の指数
    """
    s = 0
    while n % 2 == 0:
        s += 1
        n //= 2
    return s


def multiple3_or_divide2(N: int, A: list) -> int:
    return sum(num2(a) for a in A)


if __name__ == "__main__":
    N = int(input())
    A = [int(s) for s in input().split()]
    ans = multiple3_or_divide2(N, A)
    print(ans)

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

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

Solution (Python):
_=int(input())
cnt=0
for i in map(int,input().split()):
    while i%2==0:
        cnt+=1
        i=i//2
print(cnt)

Solution (Python):
n = int(input())
a_array = [int(x) if int(x) % 2 == 0 else 1 for x in input().split()]

cnt = 0
for i in a_array:
    while i % 2 == 0:
        cnt += 1
        i /= 2
else:
    print(cnt)

Solution (Python):
n,*a=map(int,open(0).read().split())

a=[s for s in a if s%2==0]
if len(a)==0:
    print(0)
    exit()
count=0

for x in a:
    while True:
        if x%2==0:
            x=x//2
            count+=1
        else:
            break
print(count)

Solution (Python):
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)

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

Solution (Python):
import bisect
ans=0

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

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

Solution (Python):
import numpy as np
N=int(input())
a=np.array(list(map(int,input().split())))

def f(x):
    ret=0
    while(x!=0 and x%2==0):
        ret+=1
        x/=2
    return ret
  
ans=0
for i in a:
    ans+=f(i)
print(ans)

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
count=0
for a in A:
    while a%2==0:
        count+=1
        a//=2
print(count)

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

ans = 0


def d(ai,ans):
    if ai % 2 != 0:
        return ans
    ans += 1
    return d(ai / 2, ans)


for ai in a:
    ans=d(ai,ans)
print(ans)

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

Solution (Python):
from sys import stdin
n = int(stdin.readline().rstrip())
al = [int(x) for x in stdin.readline().rstrip().split()]
count = 0
for a in al:
    while 1:
        if a%2 == 0:
            count += 1
            if a/2 == 1:
                break
            a = a/2
        else:
            break
print(count)

Solution (Python):
n=int(input())
a=list(map(int, input().split()))
mod=[]
cnt=0
for ai in a:
    tmp=ai
    while True:
        if tmp%2==1:
            break
        cnt+=1
        tmp//=2
print(cnt)

Solution (Python):
def dfs(n):
    ret = 0
    if n%2 == 0:
        ret = dfs(n/2) + 1
    return ret


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

lis = []

for i in range(N):
    lis.append(dfs(A[i]))

print(sum(lis))

Solution (Python):
def f(k):
    c = 0
    while k % 2 == 0:
        k = k // 2
        c += 1
    return c


def main():
    input()
    a = [int(a) for a in input().split()]

    c = 0
    for k in a:
        c += f(k)
    print(c)


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
def f(a,c):
    while a%2==0:
        c+=1
        a=int(a/2)
    return c
m=[]
for i in range(n):
    m.append(f(l[i],0))

print(sum(m))

Solution (Python):
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)

Solution (Python):
N = int(input())
a_list = list(map(int, input().split(' ')))

action = 0
for a in a_list:
    while a % 2 == 0:
        a = a / 2
        action += 1
print(action)

Solution (Python):
N = int(input())
l = [int(i) for i in input().split()]
count = 0
for i in l:
    while i % 2 == 0:
        i /= 2
        count += 1
print(count)

Solution (Python):
import sys
data = [t.rstrip() for t in sys.stdin.readlines()]

r = [i.split() for i in data]
n = [int(i) for i in r[1]]

ans = 0



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

print(ans)

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

Ans = []
for i in a:
    count = 0
    while i % 2 == 0:
        i = i//2
        count += 1
    Ans.append(count)

print(sum(Ans))

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(len(a)):
    x=0
    while x==0:
        if a[i]%2!=0:
            x=1
        else:
            s+=1
            a[i]/=2
print(s)

Solution (Python):
n=int(input())
a=[int(i) for i in input().split()]


def waru(x):
  count=0
  while x%2==0:
    x=x//2
    count+=1
  return count

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

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(31):
    for temp in a:
        if temp % (2 ** (i + 1)) == 0:
            count+=1

print(count)

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

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

Solution (Python):


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

r=0
e=False

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

Solution (Python):
N = int(input())

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

m = 0

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

print(m)

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
count=0
for a in A:
    while a%2==0:
        count+=1
        a//=2
print(count)

Solution (Python):
def c_time3_or_div2(N, A):
    
    
    return sum((bin(a)[::-1].index('1') for a in A))

N = int(input())
A = [int(i) for i in input().split()]
print(c_time3_or_div2(N, A))

Solution (Python):
n = int(input())
x = list(map(int, input().split()))
count = 0

for i in range(n):
    test = x[i]
    for j in range(30):
        if test%2 == 0:
            count += 1
            test = int(test/2)
        else:
            break

print(count)

Solution (Python):
import sys

def main():
  input = sys.stdin.readline
  N = int(input())
  A = list(map(int, input().split()))
  count = 0
  for a in A:
    while a % 2 == 0:
      count += 1
      a //= 2
  print(count)


if __name__ == '__main__':
  main()

Solution (Python):
n=int(input())
A=list(map(int,input().split()))
cnt=0

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

Solution (Python):
n= int(raw_input())
a = map(int, raw_input().split())
ans=0
for now in a:
    while(now%2==0):
        now/=2
        ans+=1
print(ans)