#!/bin/python3

import sys

def longestSequence(a):
    j = 0
    for x in range(len(a)):
        if a[x] == 1:
            j = j+1
        elif ((a[x] != 1) and (a[x]%2 != 0)):
            j = j+a[x]+1
        else:
            while a[x]%2==0:
                j = j+a[x]
                a[x] = int(a[x]/2)
            j = j+a[x]+1
    return j        
        

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