#!/bin/python3

import sys
maxmove = {}
maxmove[1] = 1
maxmove[2] = 3
maxmove[3] = 4
for i in range(1,41):
    maxmove[2**i] = 2**(i+1) - 1

primes = [2,3,5,7,11,13,17]

def calcmaxmove(k):
    
    # if k is even
    temp = k
    divit = 1
    while temp % 2 == 0:
        temp = temp//2
        divit *= 2
    if divit > 1:
        maxmove[k] = 1 + temp * maxmove[divit]
    else:
        divit = 3
        flag = True                    
        while flag:
            if divit == k:
                flag = False
                maxmove[k] = 1 + k
            elif k % divit == 0:
                temp = k // divit
                if divit not in maxmove:
                    calcmaxmove(divit)
                maxmove[k] = 1 + temp*maxmove[divit]
                flag = False
            else:
                divit += 1
        
    
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sumit = 0
    for k in a:
        if k in maxmove:
            sumit += maxmove[k]
        else:
            calcmaxmove(k)
            sumit += maxmove[k]
        #print(k, maxmove[k])
    return sumit       

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