#!/bin/python3

import sys

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

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