#!/bin/python

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sum_ = 0
    for x in a:
        if x == 1:
            sum_+= 1
        elif x%2 != 0:
            sum_+= x+1
        else:
            i = 0
            while x%(2**(i+1)) == 0:
                i+=1
            if x/(2**i) == 1:
                sum_ += 2*x - 1
            else:
                sum_ +=(x/(2**i))*(2*(2**i) - 1) + 1                   
    return sum_
if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(long, raw_input().strip().split(' '))
    result = longestSequence(a)
    print result