#!/bin/python3

import sys

def primes(n):
    primfac = []
    d = 2
    while d*d <= n:
        while (n % d) == 0:
            primfac.append(d)  # supposing you want multiple factors repeated
            n //= d
        d += 1
    if n > 1:
        primfac.append(n)
    return sorted(primfac, reverse = True)

def longestSequence(a):
    ans = 0
    for x in a:
        # print(primes(x))
        temp = 1
        ans += temp
        for y in primes(x):
            temp *= y
            ans += temp
    return ans

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