#!/bin/python3

import sys
def getMax2Square(n):
    i = 2
    while i*2 < n:
        i = i * 2
    return i//2
def getSteps(a, sq):
    rem = a
    steps = 0
    denom = a
    while denom != 1:
        rem = a//sq
        steps += rem
        denom = sq
        sq //= 2
    return steps+1
def longestSequence(a):
    res = 0
    for temp in a:
        if temp == 1:
            res += 1
        elif temp % 2 != 0:
            res += (temp+1)
        else:
            res += getSteps(temp, getMax2Square(temp))
    return res

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