#!/bin/python3

import sys
result= 0

def getMoveCount(k):
    global result
    if k==1:
        result += k
    elif k%2==1:
        result += k+1
    else:
        result += 1
        getMoveCount(k/2)
        result += 1
        getMoveCount(k/2)
    
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    for i in a:
        getMoveCount(i)

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