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())
a = list(map(int, input().split()))
cnt = 0
for i in range(n):
    while a[i]%2 == 0:
        a[i] /= 2
        cnt += 1
print(cnt)

Solution (Python):






import numpy as np



n = int(input())

arrA = np.array(input().split(),dtype=np.int64)

ans = 0
while len(arrA)>0:
    filter = (arrA%2 == 0)
    ans += len(arrA[filter])
    arrA = arrA[filter]//2

print(ans)

Solution (Python):
def func(x):
    cnt = 0
    while True:
        if x % 2 == 0:
            cnt += 1
            x = x // 2
        else:
            return cnt


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

cnt = 0
for i in range(N):
    cnt += func(a[i])

print(cnt)

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

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

def func(x):
  cnt=0
  while 1:
    if x%2==0:
      x=x//2
      cnt+=1
    else:
      return cnt

print(sum([func(x) for x in a]))

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(cnt)

Solution (Python):
x=int(input())
y=list(map(int, input().split()))

ansb=0
t=0
for i in range(x):
	t=y[i]
	while t%2==0:
		ansb=ansb+1
		t=t/2
print(ansb)

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

Solution (Python):
n,*nums = map(int, open(0).read().split())
print(sum([format(num, 'b')[::-1].find('1') for num in nums]))

Solution (Python):
n,*nums = map(int, open(0).read().split())
cnt = 0
for num in nums:
    cnt += format(num, 'b')[::-1].find('1')
print(cnt)

Solution (Python):
n,*nums = map(int, open(0).read().split())
cnt = 0
for num in nums:
    bin_num = format(num, 'b')
    cnt += bin_num[::-1].find('1')
print(cnt)

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

Solution (Python):

import sys 
import math

def exp_bin(n):
    e = 0
    while(n%2==0):
        e += 1
        n = int(n/2)
    return e

N = int(input())
A = map(int, input().split())
ans = 0
for a in A:
    ans += exp_bin(a)
print(ans)

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n = inp()
a = inpl()

def c(x):
    cnt = 0
    while x%2==0:
        cnt += 1
        x //= 2
    return cnt
mi = 0
for i in range(n):
    mi += c(a[i])
print(mi)

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

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

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

Solution (Python):
if __name__ == "__main__":
    n = int(input())
    a = list(map(int, input().split()))

    ans = 0
    for i in range(n):
        ans += format(a[i], 'b')[::-1].find('1')

    print(ans)

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

e = 0
for a in A:
    l = 0
    over = a.bit_length()
    while over - l > 1:
        m = (l+over) // 2
        if a & ((1<<m)-1) == 0: l = m
        else: over = m
    e += l
print(e)

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

e = 0
for a in A:
    l = 0
    over = a.bit_length()
    while over - l > 1:
        m = (l+over) // 2
        if a % (1<<m) == 0: l = m
        else: over = m
    e += l
print(e)

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

e = 0
for a in A:
    while a&1 == 0:
        e += 1
        a >>= 1
print(e)

Solution (Python):
def count(x):
    cnt=0
    while x!=0:
        if x%2==0:
            x//=2
            cnt+=1
        else:
            break
    return cnt
n=int(input())
a=list(map(int,input().split()))
ans=0
for aa in a:
    if aa%2==0:
        ans+=count(aa)
print(ans)

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

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

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

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

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
count=0
f=True
while f:
    b=0
    for i in range(n):
        if a[i]%2==0:
            count+=1
            a[i]/=2

            if a[i]%2==0:
                b+=1

    if b==0:
        print(count)
        exit()

Solution (Python):

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

print(tmp)

Solution (Python):

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

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

Solution (Python):

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

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

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(n):
    a = A[i]
    ans += format(a, 'b')[::-1].find('1')
print(ans)

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

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

ans = 0
for a in A:
    while a % 2 == 0:
        if not a:
            break
        ans += 1
        a //= 2

print(ans)

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

e = 0
for a in A:
    while a&1 == 0:
        e += 1
        a >>= 1
print(e)

Solution (Python):
import sys
readline = sys.stdin.readline

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

ans = 0


for i in a:
    num = 1
    while (i % 2 ** num) == 0:
       ans += 1
       num += 1

print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
N = int(input())
a = [int(x) for x in input().split()]

def beki(i) :
    t = 0
    while i%2 == 0 :
        t += 1
        i //= 2
    return t

ans = 0
for i in a :
    ans += beki(i)

print(ans)

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

z=[]
for i in range(n):
    x,y=0,l[i]
    while y%2==0:
        x+=1
        y=y//2
    else:
        z.append(x)

print(sum(z))

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

z=[]
for i in range(n):
    x,y=0,l[i]
    for j in range(10**9):
        if y%2==0:
            x+=1
            y=y//2
        else:
            z.append(x)
            break

print(sum(z))

Solution (Python):



from fractions import gcd 
from functools import reduce
import sys
sys.setrecursionlimit(200000000)
from inspect import currentframe




def printargs2err(*args):
    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' : '+repr(arg) for arg in args),file=sys.stderr)
def debug(*args):
    print(*args,file=sys.stderr)

def printglobals():
    for (symbol, value) in globals().items():
        print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
def printlocals():
    for (symbol, value) in locals().items():
        print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)

def pin(type=int):
    return map(type,input().split())
     


                
def resolve():
    N,=pin()
    b=list(pin())
    
    ans=0
    for i in range(N):
        temp=0
        t=b[i]
        while(t%2==0):
            t//=2
            temp+=1
        
        ans+=temp
    print(ans)
        


"""


"""
"""
お前カッコ閉じるの忘れてるだろ
"""
import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """3
5 2 4"""
        output = """3"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """4
631 577 243 199"""
        output = """0"""
        self.assertIO(input, output)
    
if __name__=="__main__":resolve()

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

for i in A:
    while(i % 2 == 0):
        t += 1
        i = i // 2
print(t)

Solution (Python):


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


a_even_list=[]
for v in a_list:
    if v%2 == 0 and v != 0:
        a_even_list.append(v)

cnt=0
for v in a_list:
    while v%2 == 0 and v != 0:
        v /= 2
        cnt += 1

print(cnt)

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


if __name__ =='__main__':
    main()

Solution (Python):
N = int(input())
A = [int(v) for v in input().strip().split(" ")]

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

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

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

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

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

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

Solution (Python):
N = int(input())
ARR = [int(s) for s in input().split(" ")]

def calculate(arr):
    evens = []
    for ar in arr:
        if ar % 2 == 0:
            evens.append(ar)

    counts = 0
    for ev in evens:
        while ev % 2 == 0:
            counts = counts + 1
            ev = ev / 2
    print(counts)

calculate(ARR)

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

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

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

Solution (Python):

def cnt_2(x):
    cnt=0
    while x%2==0:
        cnt+=1
        x//=2
    return cnt
n=int(input())
print(sum([cnt_2(int(x)) for x in input().split()]))

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

Solution (Python):
def m2p(ai):
    aii=ai
    k=0
    ra=aii%2
    while ra==0 and aii>0:
        k=k+1
        aii=aii//2
        ra=aii%2
    return k        

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

m=0
for i in range(n):
    m=m+m2p(a[i])

print(m)

Solution (Python):
def f(n):
    count = 0
    while n>1 and n%2==0:
        n/=2
        count += 1
    return count


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

ans = list(f(i) for i in A)

print(sum(ans))

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
c = 0
a = [j for j in a if j % 2 == 0]
a.sort(reverse = True)

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

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

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

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

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

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

print(ans)

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



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

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

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

Solution (Python):
import numpy as np
N = int(input())
a = np.array(list(map(int, input().split())))
ans = 0
while len(a) != 0:
    a = a[a % 2 == 0]
    ans += len(a)
    a = a // 2
print(ans)

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

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

Solution (Python):
lis=[]
N=int(input())
a=list(map(int, input().split()))
count=0
for i in range(N):
    m=a[i]
    while m%2==0:
        m=m/2
        count=count+1
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 = list(map(int, input().split()))


def cnt_2(num):
    cnt = 0
    while num % 2 == 0:
        num //= 2
        cnt += 1
    return cnt

_cnt=0
for i in range(N):
    _cnt+=cnt_2(a[i])
print(_cnt)

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

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

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

answer = 0
for a in A:
    answer += cnt2(a)
    
print(answer)

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





n=ii()
arr=limii()

ans=0

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

Solution (Python):

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

Solution (Python):
import sys
import itertools



read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def count(num):
    cnt = 0
    while num % 2 == 0:
        cnt += 1
        num //= 2
    return cnt


N, *a = map(int, read().split())
ans = 0
for i in a:
    ans += count(i)
print(ans)

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


def trial_division(n):
    
    factor = []
    
    while n % 2 == 0:
        n //= 2    
        factor.append(2)
    
    if not factor:
        return [n]
    else:
        factor.append(n)
        return factor


count = 0
for i in a:
    temp = trial_division(i)
    count += temp.count(2)

print(count)

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


def trial_division(n):
    factor = []
    tmp = int(math.sqrt(n)) + 1
    for _ in range(2,tmp):
        while n % 2 == 0:
            n //= 2
            factor.append(2)
    if not factor:
        return [n]
    else:
        factor.append(n)
        return factor


count = 0
for i in a:
    temp = trial_division(i)
    count += temp.count(2)

print(count)

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

count = 0

for num in a_list:
  while True:
    if num % 2 != 0:
      break
    num //= 2
    count += 1

print(count)

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

count = 0

for num in a_list:
  while True:
    if num % 2 == 0:
      num //= 2
      count += 1
    else:
      break

print(count)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
def ni(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+=ni(a[i])
print(ans)

Solution (Python):
def connt_half(n):
    return (n ^ (n - 1)).bit_length() - 1


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


ans = 0
for v in a:
    ans += connt_half(v)

print(ans)

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

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

Solution (Python):
import collections
import numpy as np

def prime_factorize(n):
	a = 0   
	while n % 2 == 0:
		a+=1
		n //= 2
	return a

N =int(input())

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

ans_array = np.zeros(N)

for i in range(N):
    dummy = prime_factorize(a[i])
  
    ans_array[i] = dummy
ans = int(sum(ans_array))
print(ans)

Solution (Python):
n=int(input())
num=list(map(int,input().split()))
cnt=0
def cnt_2(n):
  cnt=0
  while n>1:
    if n%2==0:
      n//=2
      cnt+=1
    else:
      break
  return cnt
    
for i in num:
  cnt+=cnt_2(i)
print(cnt)

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

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

Solution (Python):
input()
print(sum([bin(i)[::-1].index('1') for i in map(int,input().split())]))

Solution (Python):
import collections


class Solution:
    def solve(self, N: int, a) -> int:

        def numFactor(n: int, d: int) -> int:
            if d < 2:
                return -1
            else:
                cnt = 0
                tmp = n
                while tmp % d == 0:
                    cnt += 1
                    tmp //= d

                return cnt

        answer = 0

        for ai in a:
            answer += numFactor(ai, 2)

        return answer


if __name__ == '__main__':

    
    N = int(input())

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

    
    solution = Solution()
    ans = solution.solve(N, a)

    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:
        A[i] //= 2
        ans += 1
print(ans)

Solution (Python):
import math

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

bases = []
i = 1
while True:
    i = i * 2
    if i < 1000000000:
        bases.append(i)
    else:
        break

bases.reverse()

ans = 0
for ai in a:
    for i, base in enumerate(bases):
        if ai % base == 0:
            ans += len(bases) - i
            break

print(ans)

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











def count2(n):
    count = 0
    while True:
        if n % 2 == 0:
            n //= 2
            count += 1
        else:
            break
    return count  

for ai in a:
    
    
    answer += count2(ai)

print(answer)

Solution (Python):
if __name__ == '__main__':
  n = int(input())
  ni = list(map(int, input().split()))

  total = 0
  for i in ni:
    while not i%2:
      i //= 2
      total += 1
  print(total)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n):
    a_i=a[i]
    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):
    while a[i] % 2 == 0:
        a[i] /= 2
        c += 1
print(c)

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

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

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


lis = [cnt_div2(i) for i in a]
print(sum(lis))

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

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

ans = 0
for i in a:
  ans += bai(i)
print(ans)

Solution (Python):
import math
import copy
import sys
import fractions
import numpy as np
from functools import reduce
import statistics




def getInputInt():
    inputNum = int(input())
    return inputNum


def getInputListInt():
    outputData = []
    inputData = input().split()
    outputData = [int(n) for n in inputData]

    return outputData


def getSomeInputInt(n):
    outputDataList = []
    for i in range(n):
        inputData = int(input())
        outputDataList.append(inputData)

    return outputDataList


def getSomeInputListInt(n):
    inputDataList = []
    outputDataList = []
    for i in range(n):
        inputData = input().split()
        inputDataList = [int(n) for n in inputData]
        outputDataList.append(inputDataList)

    return outputDataList




def gettwice(n):
    counter = 0
    flg = True
    while (flg):
        if n % 2 == 1:
            flg = False
        else:
            n = n / 2
            counter += 1

    return counter


n = getInputInt()
data = getInputListInt()

ans = 0

for i in range(len(data)):
    ans += gettwice(data[i])

print(ans)

Solution (Python):
import math
import copy
import sys
import fractions
import numpy as np
from functools import reduce
import statistics




def getInputInt():
    inputNum = int(input())
    return inputNum


def getInputListInt():
    outputData = []
    inputData = input().split()
    outputData = [int(n) for n in inputData]

    return outputData


def getSomeInputInt(n):
    outputDataList = []
    for i in range(n):
        inputData = int(input())
        outputDataList.append(inputData)

    return outputDataList


def getSomeInputListInt(n):
    inputDataList = []
    outputDataList = []
    for i in range(n):
        inputData = input().split()
        inputDataList = [int(n) for n in inputData]
        outputDataList.append(inputDataList)

    return outputDataList




def gettwice(n):
    counter = 0
    flg = True
    while (flg):
        if n % 2 == 1:
            flg = False
        else:
            n = n / 2
            counter += 1

    return counter


k = getInputInt()
data = getInputListInt()

ans = 0

for i in range(len(data)):
    ans += gettwice(data[i])

print(ans)

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

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

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

Solution (Python):
n=int(input())
*a,=map(int,input().split())
cnt=0
for i in a:
    while True:
        if i %2 ==0:
            cnt+=1
            i=i//2
        else:
            break
print(cnt)

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

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
c=0
for i in range(N):
    X = a[i]
    for j in range(30):
        if X%2==0:
            c+=1
            X = X//2
        else:
            break
print(c)

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

n=int(input())
l=list(map(int,input().split()))
sum=0
for i in range(n):
  sum+=count(l[i])
print(sum)

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

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

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

total = 0
for i in ni:
  while not i%2:
    i //= 2
    total += 1
print(total)

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

def f(i):
  cnt = 0
  while not i%2:
    i //= 2
    cnt += 1
  return cnt
total = 0
for i in ni:
  total += f(i)
print(total)

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

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

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

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
 
def f(n):
  cnt = 0
  while(n%2==0):
    n = n//2
    cnt +=1
  return cnt
 
total = 0
for e in a:
  total += f(e)
print(total)

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

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

ans = 0
for a in A:
    t = a
    s = 0
    while t%2 == 0:
        t//=2
        s += 1
    ans = ans + s
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:
        a[i]=a[i]//2
        ans+=1
        
print(ans)

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

count = 0

for i in range(0, 30):
    for j in range(N):
        if int(a_list[j]) % 2 == 0:
            a_list[j] = int(int(a_list[j]) / 2)
            count += 1

print(count)

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

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]/=2
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:
        A[i]//=2
        ans+=1
print(ans)

Solution (Python):
def main():
    N = int(input())
    numbers = list(map(int, input().split(" ")))
    answer = 0
    odds = 0
    while odds < N:
        odds = 0
        for i in range(N):
            if not numbers[i] % 2:
                numbers[i] //= 2
                answer += 1
            else:
                odds += 1
    print(answer)


if __name__ == '__main__':
    main()

Solution (Python):
def divisionCnt(n):
    cnt = 0
    while n % 2 == 0:
        n = n / 2
        cnt += 1
    return cnt

N = int(input())
numbers = [int(i) for i in input().split() if int(i) % 2 == 0]

cnt = 0
for n in numbers:
    cnt += divisionCnt(n)

print(cnt)

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

for i in range(1,31):
  for j in range(n):
    if a[j] % (2**i) == 0:
      ans += 1
      
print(ans)

Solution (Python):
def time2(n):
  ans = 0
  while n % 2 == 0:
    n /= 2
    ans += 1
  return ans
N = int(input())
LA = list(map(int, input().split()))
sum = sum(map(time2, LA))
print(sum)