#!/bin/python3

import sys

dp = dict()
prime = []
    
def primes():
    global prime
    dp = dict()
    for i in range(10 ** 6 + 4):
        dp[i] = 1
    for i in range(2, 10 ** 6 + 4):
        if i in dp:
            prime.append(i)
            for j in range(i, 10 ** 6 + 4, i):
                if j in dp:
                    dp.pop(j)

def longestSequence(a):
    answer = 0
    for i in a:
        answer += helper(i)
    return answer

def helper(n):
    original = n
    global prime
    divisor = []
    for i in prime:
        count = 0
        while n % i == 0:
            count += 1
            n = n // i
        if count > 0:
            divisor.append((i, count))
        if n == 1:
            break
    if n != 1:
        divisor.append((n, 1))
    answer = 0
    part = 1
    for i in range(len(divisor) - 1, -1, -1):
        p, count = divisor[i]
        for j in range(count):
            answer += part
            part *= p
    return answer + original
    

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