#!/bin/python

import sys

def longestSequence(a):
    su=0
    for i in a:
        if(i%2==0):
            d=1
            tmp=i
            while int(tmp/d)>=1:
                su+=(tmp/d)
                d=d*2
        else:
            if i!=1:
                su=su+i+1
            else:
                su+=i
    return su     
                
            

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