import sys

def prime_factors(n):
    i = 2
    factors = []
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    return factors

def longestSequence(a):
    tsol = 0
    for ela in a:
        pf = prime_factors(ela)
        sol, num = 1, 1
        for i in range(len(pf)-1, -1, -1):
            num *= pf[i]
            sol += num
        tsol += sol
    return tsol

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