#!/bin/python3

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sumarr=[]
    for i in a:
        if i==1:
            sumarr.append(1)
        else:
            digi=i
            q=digi
            s1=0
            sum1=0
            while(digi>0):
                s1=int(digi/2)
                sum1 +=s1
                sum1 +=int(digi%2)
                digi=int(digi/2)

            if q%2!=0:
                sum1=sum1+1

            else:
                sum1 =(sum1*2)-2

            sumarr.append(sum1)
    return(sum(sumarr))

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