#!/bin/python3


from math import floor,sqrt
import sys

def eratosthenes(n):
    """Uses the sieve of Eratosthenes to compute all primes not exceeding n"""
    is_prime = [True]*((n-1)//2)
    for p in range(3,floor(sqrt(n))+1,2):
        if is_prime[(p-3)//2]:
            is_prime[(p**2-3)//2::p] = [False]*((n-p**2)//(2*p)+1)
        #print("p = "+str(p)+"   "+str(is_prime))                               
    return [2]+[2*i+3 for i in range((n-1)//2) if is_prime[i]]


def longestSequence(a):
    primes = eratosthenes(10**6+100)
    res = 0
    for val in a:
        res += val
        factors = []
        for p in primes:
            while val % p == 0:
                factors.append(p)
                val //= p
            if p**2 > val:
                if val > 1:
                    factors.append(val)
                break
        mult = 1
        for p in factors[-1::-1]:
            res += mult
            mult *= p
    return res

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