#!/bin/python3

import sys
import math

def factors(n):
    result = set()
    for i in range(1,int(math.sqrt(n))+1):
        quo,rem = divmod(n,i)
        if rem==0:
            result |= {i,quo}
    return result   
  
def longestSequence(a):
    l = []
    for k in a:
        if k==1:
            l.append(1)
        elif k%2!=0:
            l.append(sum(factors(k)))
        elif k%2==0:
            s = 0
            m = k
            while m != 0:
                s += m
                m = int(m/2)
            l.append(s)
    
    return sum(l)   
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)