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

Solution (Python):


def resolve():
    N=int(input())
    count=0
    for i in input().split():
        x=int(i)

        while x%2==0:
            count+=1
            x /=2
    print(count)



if __name__ == "__main__":
    resolve()

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

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

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




def n_factor2(x):
    i = 0
    while x%2 == 0:
        x /= 2
        i += 1
    return i

ans = 0
for x in a:
    ans += n_factor2(x)

print(ans)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
cnt =0
for x in a:
    for i in range(1,30):
        if x %2**i ==0:
            cnt+=1
print(cnt)

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    a = list(map(int, input().rstrip('\n').split()))
    cnt = 0
    for i in range(n):
        t = a[i]
        while True:
            if t % 2 == 0:
                cnt += 1
                t //= 2
            else:
                break
    print(cnt)


if __name__ == '__main__':
    slove()

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

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

Solution (Python):
from collections import deque

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

ans = 0

while s :
    a = s.popleft()
    if a%2==0:
        s.append(a//2)
        ans +=1
print(ans)

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


if __name__ == "__main__":
    test()

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

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

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

c = 0

for i, aa in enumerate(a):
    while a[i] % 2 == 0:
        a[i] /= 2
        c += 1

print(c)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
Ans = [1]
for i in A:
    if i%2 == 0:
        Ans.append(i)
cnt = 0
for j in Ans:
    while j%2 == 0:
        cnt += 1
        j = j//2
print(cnt)

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

ret = 0
for a_ in a :
    while a_ % 2 == 0 :
        a_ //= 2
        ret += 1
        
print(ret)

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

for sa in a:
    while sa % 2 ==0:
        sa //= 2
        res += 1

print(res)

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

Solution (Python):
def fact2( n ):
    ans = 0
    while n > 0:
        if n % 2 == 0:
            n = n // 2
            ans += 1
        else:
            break
    return ans

N = int(input())
Data = list(map(int,input().split()))
ans = 0
for d in Data:
    ans += fact2(d)
print(ans)

Solution (Python):
import math

def wareru(s):

    buff = s
    c = 0
    while True:
        if buff % 2 == 0:
            c+=1
            buff = buff / 2
        else:
            return c

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

ans = 0
for i in range(N):
    ans += wareru(A[i])
    
    

    
    
    

print(ans)

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

Solution (Python):
import sys


def input(): return sys.stdin.readline().strip()


def solve(N, a):
    def f(x): return 0 if x % 2 != 0 else 1+f(x//2)
    ans = sum(map(f, a))
    return ans


def main():
    N = int(input())
    a = list(map(int, input().split()))
    ans = solve(N, a)
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
A = 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()))

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

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

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

cnt=0
for a in A:
    f=factorization(a)[0]
    if f[0]==2:
        cnt+=f[1]

print(cnt)

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

Solution (Python):
def div2(n):
  i=n
  a=0
  while True:
    if i%2!=0:
      return a
    i//=2
    a+=1

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

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

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

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

Solution (Python):
def q77(N, a):
    i = 0
    for b in a:
        while True:
            b = b/2
            if not b.is_integer():
                break
            else:
                i += 1
    return i

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

print(q77(N, a))

Solution (Python):
import math
def q77(N, a):
    i = 0
    o = 0
    while True:
        b = False
        for j in range(o, N):
            a[j] = a[j]/2
            if a[j].is_integer():
                i += 1
                b = True
                break
            else:
                o = j
        if not b:
            break
    return i

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

print(q77(N, a))

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

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

print(ans)

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

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

print(sum(count2(a) for a in A))

Solution (Python):
def count2(x):
    count = 0
    while x % 2**10 == 0:
        x //= 2**10
        count += 10
    while x % 2 == 0:
        x //= 2
        count += 1
    return count

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

print(sum(count2(a) for a in A))

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

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

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

b=[]
for i in range(1,30):
    b.append(2**i)

ans=0
u=len(b)
for i in range(n):
    for j in range(u):
        if a[i]%b[j]==0:
            ans+=1
print(ans)

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

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

score = 0
for a in list_a:
    while 1:
        if a % 2 == 0:
            score += 1
            a = a/2
        else:
            break
            
print(score)

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

cnt = 0

for i in range(N):
    x = 1
    while True:
        if a[i] % 2**x:
            cnt += x - 1
            break
        x += 1

print(cnt)

Solution (Python):
N = int(input())
A = list(filter(lambda x: x % 2 == 0, map(int, input().split())))

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

Solution (Python):
def main():
    N = int(input())
    A = [int(i) for i in input().split()]
    def count_div_by2(num):
        cnt = 0
        while num%2 == 0:
            cnt += 1
            num //= 2
        return cnt
    print(sum(count_div_by2(n) for n in A))
if __name__ == '__main__':
    main()

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


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

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

if __name__ == '__main__':
    main()

Solution (Python):
def hoge(num):
  for i in range(10**10):
    if(num % (2 ** i) != 0):
      return i - 1
    
n = int(input())
print(sum(list(map(lambda x: hoge(int(x)), input().split()))))

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

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

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

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

Solution (Python):
n=int(input())
a=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=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 = map(int, input().split())
print(sum([sum([1 for i in range(30) if n % (2**(i + 1)) == 0]) for n in a]))

Solution (Python):
n = int(input())
A = [int(num) for num in input().split()]

counter = 0
for i in range(n):
  for j in range(10000):
    if A[i] % 2 == 0:
      counter += 1
      A[i] //= 2
    else:
      break
print(counter)

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

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

print(x)

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

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

print(sum([count_divide(ai) for ai in a]))

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

ans = 0

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

print(ans)

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

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

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

Solution (Python):
_ = input()
A = list(map(int, input().strip().split(' ')))

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

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

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

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

for i in range(n):
  tmp = a[i]
  for j in range(99**99):
    if tmp % 2 == 0:
      cnt += 1
      tmp //= 2
    else:
      break
      
print(cnt)

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

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

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

def devide(x):
    count = 0
    if x % 2 == 0:
        count += 1 + devide(x//2)
    return count
print(sum(devide(x) for x in A))

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from functools import reduce



INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


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


n = I()

ans = 0
for i in LI():
    ans += D(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=a//2
    ans+=1
print(ans)

Solution (Python):
from functools import reduce
input()
print(format(reduce(lambda x, y: x*y, (map(int, input().split()))), "b")[::-1].find("1"))

Solution (Python):

def main():
    N, *A = map(int, open(0).read().split())
    ans = sum(bin(i)[::-1].index("1") for i in A)
    print(ans)


if __name__ == "__main__":
    main()

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

res = 0
for a in arr:
    while a % 2 == 0:
        res += 1
        a //= 2

print(res)

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

res = 0

for a in arr:
    while a > 1:
        if a % 2 == 0:
            res += 1
            a //= 2
        else:
            break

print(res)

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

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

def check_number_of_devide_by_2(n):

    count = 0
    while n%2==0:
        count += 1
        n = n/2
    
    return count

N = int(input())

list_a = [check_number_of_devide_by_2(i) for i in list(map(int, input().split()))]


print(sum(list_a))

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

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

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

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

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

Solution (Python):
n = int(input())
ls = list(map(int, input().split()))
counts = []
for x in ls:
    y = x
    count = 0
    while True:
        if y % 2 == 0:
            y //= 2
            count += 1
        else:
            counts.append(count)
            break
print(sum(counts))

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

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

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

print(aCnt)

Solution (Python):
import math

n = int(input())
a = sorted(list(map(int, input().split())))
aMax, aNum, aMaxSum = 0, 0, 0

for i in range(n):
    aNum, aCnt = a[i], 0
    while aNum % 2 == 0 and aNum / 2 == aNum // 2:
        aCnt += 1
        aNum /= 2
    aMaxSum += aCnt

print(aMaxSum)

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

    ans+=c
print(ans)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
ans = 0
"""
一番大きい偶数を2で割る
それ以外は3倍
を繰り返す
奇数だけになったら終了
↓
各項が2で何回われるか の合計
"""
for i in range(n):
    cnt = 0
    tmp = a[i]
    while tmp % 2 == 0:
        tmp = tmp // 2
        cnt += 1
    ans += cnt
print(ans)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
ans = 0
"""
一番大きい偶数を2で割る
それ以外は3倍
を繰り返す
奇数だけになったら終了
↓
各項が2で何回われるか の合計
"""
for i in range(n):
    cnt = 0
    tmp = a[i]
    while True:
        if tmp % 2 == 0:
            tmp = tmp // 2
            cnt += 1
        else:
            break
    ans += cnt
print(ans)

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

c = 0
for i in A:
    while i % 2 == 0:
        i /= 2
        c += 1

print(c)

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

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

print(ans)

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

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

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

Solution (Python):
import math
def resolve():
    n = int(input())
    aaa = list(map(int, input().split()))
    ans = 0
    for i in range(n):
        temp = aaa[i]
        if temp % 2 != 0:
            continue
        else:
            count = 1
            for j in range(10**9):
                temp = temp / 2
                if temp % 2 != 0:
                    ans += count
                    break
                count += 1            
    print(int(ans))
resolve()

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

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

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

def checkIncludeNum2(num):
    ret = 0
    while num % 2 == 0:
        num /= 2
        ret += 1
    
    return ret

print(sum([checkIncludeNum2(i) for i in A]))

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

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

l = [int(i) for i in input().split()]
ct = 0

for i in l:
    while i % 2 == 0:
        ct += 1
        i = i//2
    
print(ct)

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

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

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

    print(ans)

if __name__ == '__main__':
    main()

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

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

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

for i in s:
    count = format(i, 'b')[::-1].find('1') + count

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

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

print(ans)

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

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

print(sum(b))

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())
ls=[int(s) for s in input().split()]
count=0
for i in range(N):
  while True:
    if ls[i]%2!=0:
      break
    else:
      count+=1
      ls[i]=ls[i]//2
print(count)

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

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):
N=int(input())
a=list(map(int,input().split()))
ans=0
def f(n):
  ans=0
  while n%2==0:
    n=int(n/2)
    ans+=1
  return ans
List=[]
for i in range(N):
  if a[i]%2==1:
    pass
  else:
    List.append(a[i])
if len(List)==0:
  print(0)
else:
  for i in range(len(List)):
    ans+=f(List[i])
  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):
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()))
ans = 0
for a in A:
    tmp = 1
    while(a > tmp):
        tmp = tmp << 1
        if a % tmp == 0:
            ans += 1
print(ans)

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

Solution (Python):

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

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

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

Solution (Python):
import sys
from collections import deque
from functools import reduce
import copy
import math


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    A = string_to_int(inputs[0])
    odds = []

    for a in A:
        if a % 2 == 0:
            odds.append(a)
    count = 0
    for o in odds:
        while o % 2 != 1:
            o /= 2
            count += 1

    return count


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    input()
    ret = solve(inputs(1))
    print(ret)

Solution (Python):
def factors(num, factor):
  count = 0
  while num % factor == 0:
    count += 1
    num //= factor
  return count

input()
print(sum(factors(int(tok), 2) for tok in input().split()))

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

ops = 0

for x in v:
    while x % 2 == 0:
        ops += 1
        x /= 2

print(ops)

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

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

    count = 0
    for i in range(N):
        while not a[i]&1:
            count += 1
            a[i] >>= 1
    print(count)

if __name__ == "__main__":
    main()

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

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

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

print(cnt)

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

Solution (Python):
import sys
from collections import deque
from collections import  Counter
import statistics
import math
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

n = ni()
aaa = na()
ct = 0
for i in range(n):
    while True:
        if aaa[i] % 2 == 0:
            aaa[i] //= 2
            ct += 1
        else:
            break
print(ct)

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

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

print(cnt)

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

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

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

cnt = 0
for num in a:
	temp = num
	while temp % 2 == 0:
		cnt += 1
		temp = temp // 2


print(cnt)

Solution (Python):
input()
a = input().split(' ')

ans = 0
for ax in a:
    ax = int(ax)
    while ax % 2 == 0:
        ax //= 2
        ans += 1

print(ans)

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

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

print(ans)