#!/bin/python3

import sys

final = [0]*(10**6)
final[1] = 1
final[2] = 3 
final[3] = 4
final[4] = 4
final[5] = 6
for i in range(6,10**6,2):
    temp=0
    n=i
    final[i+1]=i+2
    while i>0:
        temp+=i
        i=i//2
        if final[i]!=0:
            temp+=final[i]
            break
    final[n]=temp    

        
    

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    s=0
    for i in a:
        s+=final[i]
    return s
                
            

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