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

cc = 0

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

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

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, A):
    ans = 0
    for a in A:
        while a % 2 == 0:
            a //= 2
            ans += 1

    return ans


def main():
    N = read_int()
    A = read_int_n()
    print(slv(N, A))


if __name__ == '__main__':
    main()

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

ans = 0

while True:
  flag = 0
  for x in range( len(a) ):
    if a[x] % 2 == 0:
      a[x] = a[x]/2
      ans += 1
      flag = 1
  if flag == 0:
    break

print ans

Solution (Python):
n = int(input())
A = [int(i) for i in 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 True:
        if i % 2 == 0:
            i /= 2
            ans += 1
        else:
            break
print(ans)

Solution (Python):
def num_of_division_by_2(num):
    
    count = 0
    current_num = num
    while current_num % 2 == 0:
        current_num //= 2
        count += 1
    return count

N = int(input())
a_list = [int(elem) for elem in input().split(' ')]
assert len(a_list) == N

total_num_division = 0
for a in a_list:
    total_num_division += num_of_division_by_2(a)

print(total_num_division)

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

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

def div2(x):
    while x % 2 == 0:
        x /= 2
        yield 1

print(sum(sum(div2(x)) for x in xs))

Solution (Python):
N = int(input())
a = [int(i) for i in input().split()]
def times(n):
  if n%2==1:
    return 0
  else:
    return 1+times(n/2)
b = [times(n) for n in a]
ans =sum(b)
print(ans)

Solution (Python):
N = int(input())
a = [0 for i in range(N)]


a = input().split()

for i in range(N):
    a[i] = int(a[i])

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

print(count)

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

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


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


print(sum(map(div2count, a)))

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

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

Solution (Python):



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

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

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

for i in range(len(a)):
    a[i] = f(a[i])
print(sum(a))

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

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

arr = list(map(int,input().split()))
out = 0

for num in arr:
    i = 1
    temp = num *1
    while temp%2 == 0:
        temp = temp//2
        i += 1
    out += i-1

print(out)

Solution (Python):
N = int(input())
A = input().split()
ans = 0

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

print(ans)

Solution (Python):
def main():
    N = int(input())
    a = list(map(int, input().split()))
    count = 0
    for i in range(N):
        aa = a[i]
        while aa%2==0 and aa>0:
            aa = aa//2
            count += 1
    return count

if __name__ == "__main__":
    print(main())

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

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

count=0
for a in A:
    num = a
    while True:
        if num/2 == int(num/2):
            count += 1
            num = num/2
        else:
            break
print(count)

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

Solution (Python):

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

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

print(ans)

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(len(a)):
    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 a in a_list:
    while True:
        if a % 2 == 1: break
        cnt += 1
        a = a / 2

print(cnt)

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

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

print(two)

Solution (Python):


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

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

print(cnt)

Solution (Python):
import bisect
n = int(input())
nums=list(map(int,input().split()))
list2 = [pow(2,x) for x in range(31)]
total = 0
for num in nums:
  if num%2 == 0:
    tmp = bisect.bisect_right(list2,num)
    for i in range(tmp,0,-1):
      if num % list2[i] == 0:
        total += i
        break
print(total)

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

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

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
print(sum([len(bin(a).split('1')[-1]) for a in A]))

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

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

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

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

count = 0
for x in li:
    while(x % 2 == 0):
        count = count + 1
        x = x / 2

print(count)

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

def maxDevineNum(num):
    ans=0
    while num%2**ans==0:
        ans+=1
    return ans-1

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

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())
ans = 0
for i in input().split():
  num = int(i)
  while num % 2 == 0:
    num /= 2
    ans += 1

print(ans)

Solution (Python):
def c_time3_or_div2(N, A):
    ans = 0  
    for a in A:
        while a % 2 == 0:
            ans += 1
            a //= 2
    return ans

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

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

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

print(count)

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

count = 0

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

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


N=int(input())
print(sum([f(int(i)) for i in input().split(" ")]))

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

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

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

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

def two(x):
    i=0
    while True:
        if x%2==0:
            x=x//2
            i+=1
        else:
            break

    return(i)

ANS=0
for i in range(N):
    ANS+=two(A[i])

print(ANS)

Solution (Python):
import sys

cin = sys.stdin



def line2N():
    return map(int, cin.readline().split())


N, = line2N()
a = list(line2N())
t = [0] * N

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

print(sum(t))

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

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

print(answer)

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

b = [len(bin(i)) - bin(i).rfind('1') - 1 for i in a]

print(sum(b))

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

def f(x):
    if x % 2 == 0:
        return 1 + f(x // 2)
    return 0

print sum(f(ai) for ai in a)

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):
import sys, math
from sys import stdin, stdout
from collections import deque
from itertools import permutations

rem = 10 ** 9 + 7
sys.setrecursionlimit(10 ** 6)
take = lambda: map(int, stdin.readline().split())

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

Solution (Python):

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


def check(n):
    tmp = n
    cnt = 0
    while tmp % 2 == 0:
        cnt += 1
        tmp //= 2

    return cnt


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

Solution (Python):

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

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

    count += count_i

print(count)

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

Solution (Python):
from sys import stdin
n = int(stdin.readline())
ans = 0 
a = map(int,stdin.readline().split())
for i in a:
    j = i 
    while j%2==0:
        j/=2
        ans += 1 
print ans

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

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

n = int(input())
a = map(int, input().split())
print(sum(calc(x) for x in a))

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

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 a in A:
    while True:
        if a % 2 == 1:
            break
        a //= 2
        ans += 1

print(ans)

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

print(a)

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

print(num)

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

sum = 0
for num in a:
    while num%2 == 0:
        sum += 1
        num = num/2.0
print(sum)

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

def dev2(a):
    count = 0
    while(True):
        if a % 2 == 0:
            a = int(a/2)
            count += 1
        else:
            break
    return count
           
b = [dev2(i) for i in a]
print(sum(b))

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

Solution (Python):


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

res = 0

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

print(res)

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):
'''input
10
2184 2126 1721 1800 1024 2528 3360 1945 1280 1776
'''
n = input()
arr = map(int,raw_input().split())
ans = 0
for i in range(n):
	while arr[i]%2 == 0:
		ans +=1
		arr[i] /= 2
print ans

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

Solution (Python):

N = int(input())
A = list(map(int, input().split()))
ans = 0
for a in A:
    ans += bin(a)[2:].split("1")[-1].count("0")

print(ans)

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


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

print(ans)

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

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

def calc(x):
    r = 0
    while 1:
        x, d = divmod(x, 2)
        if d == 1:
            return r
        r += 1

print(sum(calc(x) for x in a))

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

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

print(cnt)

Solution (Python):
def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

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


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

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()))
c = 0

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

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

Solution (Python):


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

Solution (Python):
n = int(input())
a = 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()))
def two(n):
    r=0
    while True:
        if n%2==0:n/=2;r+=1
        else:break
    return r
b=[two(i)for i in a]
print(sum(b))

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

Solution (Python):




def main():
    temp=input()
    temp=input()
    temp=list(map(int,list(temp.split(" "))))    
    
    ans=0
    for n in temp:
        while(True):
            if n%2==0:
                n/=2
                ans+=1
            else:
                break
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
A = list(map(int, input().split(' ')))
count_two = 0
for i in A:
    flag = 0
    while flag == 0:
        if i % 2 == 0:
            i = i // 2
            count_two += 1
        else:
            flag = 1

print(count_two)

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

Solution (Python):



def solve():
    n = int(input())
    al = [int(i) for i in input().split()]
    
    ans = 0
    for elem in al:
        while elem % 2 == 0:
            ans += 1
            elem //= 2
    print(ans)

if __name__=="__main__":
    solve()

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

Solution (Python):






n = int(input())
print(sum([len(bin(int(i))) - bin(int(i)).rfind("1") - 1 for i in input().split()]))

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

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

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

print(ans)

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

l = input()
l =[ int(i) for i in l.split()]
t =  0 
for i in l :
    x = i
    while x%2==0:
        x//=2
        t+=1
print(t)

Solution (Python):
N=int(input())
A=[int(i) for i in 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()))
ans = 0
for elem in a:
    tmp = elem
    while(tmp%2==0):
        tmp = tmp//2
        ans += 1

print(ans)

Solution (Python):
def read_ints():
    return [int(c) for c in input().split()]


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


def main():
    input()
    xs = read_ints()
    print(sum(count(x) for x in xs))


if __name__ == '__main__':
    main()

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

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

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

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

print(Ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
C = [0 for _ in range(len(A))]

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

print(sum(C))

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

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

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

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

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

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

print(ans)

Solution (Python):


def main():
    input()
    xx = list(map(int, raw_input().split()))
    c = 0
    for x in xx:
        while x % 2 == 0:
            x /= 2
            c += 1
    print(c)


if __name__ == '__main__':
    main()

Solution (Python):
N = input()
A = map(int, raw_input().split())
ans = 0
for a in A:
  while (a&1)==0:
    a >>= 1
    ans += 1
print ans

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    n = I()
    a = LI()
    r = 0
    for c in a:
        while c % 2 == 0:
            c //= 2
            r += 1
    return r


print(main())

Solution (Python):
import sys

stdin = sys.stdin

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

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

Solution (Python):


import sys,collections,itertools,re,math,fractions,decimal,random,array,bisect,heapq





def solve(f):
    n = f.read_int()
    a = f.read_int_list()
    ans = 0
    for ai in a:
        while ai%2 == 0:
            ans += 1
            ai /= 2

    return ans


class Reader(object):
    def __init__(self, filename=None):
        self.file = open(filename) if filename is not None else None
        self.case = 1

    def __readline(self):
        return self.file.next().strip() if self.file else raw_input()

    def next_case(self):
        self.file.next()
        self.case += 1

    def read_int(self): return int(self.__readline())
    def read_float(self): return float(self.__readline())
    def read_long(self): return long(self.__readline())
    def read_decimal(self): return decimal.Decimal(self.__readline())
    def read_str(self): return self.__readline()

    def read_int_list(self): return map(int, self.__readline().split())
    def read_float_list(self): return map(float, self.__readline().split())
    def read_long_list(self): return map(long, self.__readline().split())
    def read_decimal_list(self): return map(decimal.Decimal, self.__readline().split())
    def read_str_list(self): return self.__readline().split()

if __name__ == '__main__':
    filename = sys.argv[1] if len(sys.argv) > 1 else None
    f = Reader(filename)
    if f.file:
        while True:
            print "Case 
            try:
                f.next_case()
            except StopIteration:
                break
    else:
        print solve(f)

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

Solution (Python):
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

N = read()
a = reads()

def p2(x):
  res = 0
  while x & 1 == 0:
    x = x >> 1
    res += 1
  return res

ans = sum(p2(x) for x in a)
print(ans)