import sys

def longestSequence(a):
    sum1=0
    #  Return the length of the longest possible sequence of moves.
    for i in a:
        
        j=i
        if i%2!=0:
            if i==1:
                sum1+=i;
            else:
                sum1+=i+1;
        else:
            while j!=0:
                sum1+=int(j)
                j=int(j/2)
            if j%2!=0:
                sum1+=j
    return sum1

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)