#!/bin/python3

import sys

def longestSequence(a):
    result = 0
    flag = 0
    for i in a:
        sayac = 1
        while i != 1:
            if i % 2 == 1:
                result += 1
                i -= 1
            else:
                sayac *= (i/2)
                result += sayac + 1
                i = i / 2

        result += i
    return int(result)
    #  Return the length of the longest possible sequence of moves.

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