#!/bin/python3

import sys
def cal(n):
    if n==1:
        return 1;
    elif n%2==1:
        return n+1
    else:
        return n+cal(n//2);
    
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sum=0
    for i in a:
        sum=sum+cal(i)
    return sum
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)