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):



from fractions import gcd
from itertools import combinations,permutations,accumulate, product 

from collections import deque,defaultdict,Counter
import decimal
import re












import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
n = I()
A = readInts()
ans = 0
for v in A:
    while v%2 == 0:
        ans += 1
        v//=2
print(ans)

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N, *A = map(int, read().split())

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

    print(ans)
    return


if __name__ == '__main__':
    main()

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

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

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

for a in A:
    if a%2 == 0:
        ans += f(a)
print(ans)

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

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

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 = a//2
    ans += tmp

print (ans)

Solution (Python):
def div(k):
    k = int(k)
    i = 0
    while k%2==0:
        k//=2
        i+=1
    return i
n = int(input());print(sum(list(map(div, input().split()))))

Solution (Python):
import sys

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))


n = ri()
li = rl()
ans = 0
for i in li:
    t = 0
    while i & 1 == 0:
        i //= 2
        t += 1
    ans += t
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

def factorize(n):
    i = 2
    prime_factors = {}
    while i ** 2 <= n:
        exp = 0
        while n % i == 0:
            exp += 1
            n //= i
        if exp:
            prime_factors[i] = exp
        i += 1
    if n != 1:
        prime_factors[n] = 1
    return prime_factors

ans = 0
for v in a:
    prime_factors = factorize(v)
    if 2 in prime_factors:
        ans += prime_factors[2]
print(ans)

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

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

Solution (Python):
import math
N=int(input())
a=list(map(int,input().split()))
ans=0
for i in a:
  ans+=math.log2(i & -i)
print(int(ans))

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

Solution (Python):
def ni(num):
  return format(num, 'b')[::-1].find('1')
N=int(input())
L=list(map(int,input().split()))
L=list(map(ni,L))
print(sum(L))

Solution (Python):
def d(x,c):
 if x%2!=0: return c
 return d(x/2, c+1)

input()
print(sum(d(i,0) for i in map(int,input().split())))

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


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

control_count = 0
for i in range(n):
    control_count += divide_2(a[i])
print(control_count)

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

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

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

print(ans)

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

res = 0

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

print(res)

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

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

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

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()))
ct=0
for i in range(N):
  k=0
  while a[i]%2==0:
    k+=1
    a[i]//=2
  ct+=k
print(ct)

Solution (Python):
c=0
n=int(input())
ar=[int(i) for i in input().strip().split(" ")]
for i in range(n):
    t=ar[i]
    while(t%2==0):
        c+=1
        t=(t//2)
print(c)

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

for i in range(N):
    if a[i] % 2 == 0:
        x = a[i]
        while True:
            if x %2 != 0:
                break
            else:
                x = x/2
                count+=1
print(count)

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

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

for i in a:
  if i%2==0:
    K=True
    while K:
      if i%2!=1:
        i//=2
        count+=1
      else:
        K =False
          
print(count)

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

x = 0
count = 0

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

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

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

ans = 0

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

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

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

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

print(ans)

Solution (Python):
n = int(input())
A = list(map(int,input().split()))
ans = sum((a & -a).bit_length() - 1 for a in A)
print(ans)

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

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

print(sum(map(f,a)))

Solution (Python):
def resolve():
    n = int(input())
    A = list(map(int, input().split()))
    i = 0
    ans = 0
    while i<n:
        if A[i] % 2 == 0:
            A[i] //= 2
            ans += 1
        else:
            i += 1
    print(ans)
resolve()

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

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

res = 0
for i in range(n):
    j = al[i]
    while j % 2 ==0:
        res +=1
        j = j//2

print(res)

Solution (Python):
def c_time3_or_div2():
    N = int(input())
    A = [int(i) for i in input().split()]
    
    return sum((a & -a).bit_length() - 1 for a in A)

print(c_time3_or_div2())

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

Solution (Python):
n = int(input())
aa = tuple(map(int, input().split()))

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

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):


def f(N,c):
    if N%2==0:
        n=N//2
        c+=1
        return f(n,c)
    else:
        return c



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

count=0

for a in A:
    count+= f(a,0)

print(count)

Solution (Python):
N=int(input())
List = list(map(int, input().split()))
res = 0
flagWhile = True
flagManip = True
for i in range(N):
  while List[i] % 2 == 0:
    List[i] = List[i] //2
    res += 1

print(res)

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

for i in range(N):
    a_2 = 0
    while a[i]%2 == 0:
        a[i] = a[i]//2
        a_2 += 1
    b.append(a_2)
print(sum(b))

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

Solution (Python):
int_n = int(input())
li_a = list(map(int, input().split()))

answer = 0
for a in li_a:
    wk = a
    while wk % 2 == 0:
        wk = wk // 2
        answer += 1
print(answer)

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

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

ans = 0
for a in A:
    ans += f(a)
print(ans)

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):
import math 
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):
N = int(input())
a = list(map(int, input().split()))
cnt=0
for i in range(N):
  v = a[i]
  while 1:
    if v%2==0:
      v=v//2
      cnt+=1
    else:
      break

print(cnt)

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

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

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

count = 0
for a in an:
    while True:
        if a % 2 != 0:
            break
        a = a /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:
    a//=2
    ans+=1

print(ans)

Solution (Python):
def num_divide_two(num: int):
    return int(format(num, 'b')[::-1].find("1"))

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

Solution (Python):


def factorization(n):
    arr = []
    temp = n
    i = 2
    cnt=0
    if temp%i==0:
        while temp%i==0:
            cnt+=1
            temp //= i
    return cnt



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

ret = 0
for a in A:
    ret += factorization(a)

print(ret)

Solution (Python):
n,r = int(raw_input()), 0
ais = map(int ,raw_input().split())
for ai in ais:
	while(ai % 2 == 0 ):
		ai /= 2
		r += 1
print r

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 = int(input())
a = list(map(int, input().split()))

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

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

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



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

import collections
count = 0
for a in A:
    count += collections.Counter(prime_factorize(a))[2]
    
print(count)

Solution (Python):

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

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


print(ans)

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

def count(x):
    res=0
    while x%2==0:
        res+=1
        x=x//2
    return res
ans=0
for i in range(n):
    ans+=count(a[i])

print(ans)

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] /= 2
        count += 1
        
print(count)

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

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
ans = 0
def division2(x) :
    cnt = 0
    while x%2 == 0 :
        x //= 2
        cnt += 1
    return cnt
def count2(list) :
    ans = 0
    for i in range(len(list)) :
        ans += division2(list[i])
    return ans

print(count2(a))

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

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

Solution (Python):
def main():
    n=input()
    a=map(int,input().split())
    c = 0
    for x in (i for i in a if i % 2 == 0):
        while True:
            if x % 2 == 0:
                x //= 2
                c += 1
            else:
                break
    print(c)
    
if __name__ == "__main__":
    main()

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

def main():
    N = int(readline())
    a = [int(i) for i in readline().split()]
    s = 0
    for i in range(N):
        s += numOftwo(a[i])
    print(s)
if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
A = [int(i) for i in input().split()]
c = 0
for a in A:
    c += bin(a)[2:][::-1].index("1")
print(c)

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

ans = 0

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

Solution (Python):
def Div2Count(N):
    Count = 0
    while N%2==0:
        N = N//2
        Count += 1
    return Count
  
N = int(input())
A = [Div2Count(int(X)) for X in input().split()]
print(sum(A))

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

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

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

Solution (Python):
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
    n = I()
    A = LI()
    cnt = 0
    for a in A:
        while a%2 == 0:
            cnt += 1
            a //= 2
    print(cnt)

if __name__ == '__main__':
    main()

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

Solution (Python):
import math
n = int(input())
la = [int(w) for w in input().split()]

mrb = [math.log2(b & -b) for b in la]
print(int(sum(mrb)))

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):
n = int(input())
a = list(map(int, input().split()))

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

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
cnt=0
f=True
while f:
	for i in range(n):
		if a[i]>2 and a[i]%2==0:
			a[i]=a[i]//2
			cnt+=1
		else:
			a[i]=3*a[i]
			
	for ai in a:
		if ai%2==0:
			break
	else:
		f=False
			
print(cnt)

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue

from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    A = il()
    ret = 0
    for a in A:
        while a % 2 == 0:
            a //= 2
            ret += 1
    print(ret)




if __name__ == '__main__':
    main()

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

Solution (Python):

print(sum(bin(i)[::-1].find("1") for i in [*map(int, open(0).read().split())][1:]))

Solution (Python):

n, *a = map(int, open(0).read().split())
c = 0
for i in a:
    b = bin(i)
    c += len(b) - 1 - b.rfind('1')
print(c)

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

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

ans = 0
for i in range(N):
    ans += bin(A[i])[::-1].find('1')
print(ans)

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

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

L = []
for i in range(N):
    n = bin(A[i])[::-1].find('1')
    if n != 0:
        L.append(n)
if not L:
    print(0)
else:
    print(sum(L))

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

a_=[0]*N
for a_idx,a in enumerate(A):
    n=0
    while a%2 == 0:
        n+=1
        a=a/2
    a_[a_idx] = n
    
print(sum(a_))

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):
N=int(input())
A=list(map(int,input().split()))

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

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

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

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

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

Solution (Python):


N = int(input())
A = list(int(a) for a in input().split())

def devide2(x):
    if x%2:
        return 0
    else:
        ret = 0
        while True:
            ret += 1
            x //= 2
            if x%2:
                return ret

ans = 0
for a in A:
    ans += devide2(a)
    
print(ans)

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

N = i()
a = l()

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

print(count)

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

def TwoNumber(a):
    ans = 0
    while True:
        if a % 2==0:
            a = a /2
            ans += 1
        else:
            break
    return ans

ans = 0
for i in range(len(A)):
    ans += TwoNumber(A[i])

print(ans)

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):
import sys
read = sys.stdin.read
def main():
    n, *a = map(int, read().split())
    r = 0
    for ea in a:
        while True:
            if ea % 2 == 0:
                r += 1
                ea //= 2
            else:
                break
    print(r)


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

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

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: map(int, read().split())
in_s = lambda: readline().rstrip().decode('utf-8')


def main():

    N = in_n()
    A = in_nl()

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

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):

import sys


def solve(N: int, a: "List[int]"):
    def f(n):
        res = 0
        while n % 2 == 0:
            n //= 2
            res += 1
        return res
    return sum(map(f, a))



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    a = [int(next(tokens)) for _ in range(N)]  
    print(solve(N, a))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    
    main()

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue

from decimal import Decimal
from collections import defaultdict, deque



sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)


MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    A = il()
    ret = 0
    for n in range(N):
        while A[n] % 2 == 0:
            A[n] //= 2
            ret += 1
    print(ret)


if __name__ == '__main__':
    main()

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

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

print(total)

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

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

A =[0]

for i in a:
  A.append(count_2(i))
  
print(sum(A))

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

def main():
    N = int(input())
    A = list(map(int,input().split()))
    ans = 0
    for a in A:
        while a%2 == 0:
            ans += 1
            a >>= 1
    print(ans)
if __name__ == '__main__':
    main()

Solution (Python):
def main():
    n = int(input())
    As = list(map(int, input().split()))

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

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

print(ans)

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

ret = 0

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

print(ret)

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()))
count = 0
for i in range(n):
    while a[i] % 2 == 0:
        a[i] //= 2
        count+=1
print(count)

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

Solution (Python):

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

if __name__ == "__main__":
    N = int(input())
    a = list(map(int, input().split()))
    solve()

Solution (Python):
from collections import defaultdict
import bisect

def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()

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

print(ans)

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

c=0

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

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

def resolve():
    N = int(input())
    a = list(map(int, input().split()))
    ans = 0
    for i in a:
        ans += prime_factorize(i).count(2)

    print(ans)

    return

resolve()

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

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