#!/bin/python3

import sys
        
def longestSequence(a):
    c = [1 if i>1 else 0 for i in a]
    for i in range(len(a)):
        m = 1
        while m<=a[i]:
            l = len([m for k in range(int(a[i]/m)) if a[i]%m==0])
            m = m*2
            c[i] = c[i]+l
    return c    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(sum(result))