#!/bin/python3

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    moves=0
    for i in a:
        temp=i
        if temp==1:
            moves+=1
        while(temp>1):
            if temp%2!=0:
                moves+=temp+1
                break
            moves+=temp
            temp=int(temp/2)

    return moves


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