def prime_factors(n):
    factors = []
    d = 2
    while n > 1:
        while n % d == 0:
            factors.append(d)
            n /= d
        d = d + 1
        if d*d > n:
            if n > 1: factors.append(n)
            break
    return factors

n = int(input().strip())
a = list(map(int, input().strip().split(' ')))
total = n
for i in a:
    b = prime_factors(i)
    j = len(b) -1
    temp = 1
    while j >= 0:
        temp *= b[j]
        total += temp
        j -= 1
print(int(total))