def genprimes(n):
    sieve = [True] * (n/2)
    for i in xrange(3,int(n**0.5)+1,2):
        if sieve[i/2]:
            sieve[i*i/2::i] = [False] * ((n-i*i-1)/(2*i)+1)
    return [2] + [2*i+1 for i in xrange(1,n/2) if sieve[i]]
primes = genprimes(10**6)

def solve(N):
    ans = 0
    for p in primes:
        while N % p == 0:
            ans += N
            N /= p
        if N == 1: break
    if N > 1: ans += N
    return ans + 1
        
raw_input()
X = sum(solve(x) for x in map(int, raw_input().split()))
print "{}".format(X)