#!/bin/python3

import sys
import itertools
def geometric_sum(a, r, n):
    return a * (1 - r ** n) / (1 - r)
def prime_factorization(n):
    limit = n ** 0.5 + 1
    factors = []
    i = 2
    while n > 1 and i < limit:
        if n % i == 0:
            n /= i
            factors.append(i)
        else:
            i += 1
    if n > 1:
        factors.append(n)
    return [(k, len(list(g))) for k, g in itertools.groupby(factors)]
def longestSequence(a):
    s = 0
    for num in a:
        pf = prime_factorization(num)[::-1]
        a0 = 1
        for factor in pf:
            s += geometric_sum(a0, factor[0], factor[1])
            a0 *= factor[0] ** factor[1]
    return int(s + sum(a))

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