#!/bin/python3

import sys

def largest_power(number, i=2):
    div = number // 2**i
    if div * 2**i == number:
        return largest_power(number, i+1)
    else:
        return i-1
    

def how_much(number):
    if number == 2:
        return 3
    if number % 2 != 0:
        # number moves to eat all, one move to break them
        return 1 if number == 1 else number + 1
    else:
        ith_power = largest_power(number)
        n = number // 2**ith_power
        if n == 1:
            return 2**(ith_power+1) - 1
        return n * how_much(2**ith_power) + 1

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    res = 0
    for num in a:
        res += how_much(num)
    return res
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)