#!/bin/python3

import sys

NPr = 10**6 + 10

psieve = [True]*NPr
psieve[0] = False
psieve[1] = False
primes = []
for i in range(NPr):
    if psieve[i]:
        primes.append(i)
        for j in range(i,NPr,i):
            psieve[j] = False


def nmoves(x):
    pf = []
    y = x
    for p in primes:
        while x % p == 0:
            pf.append(p)
            x = x//p
        if x == 1 or p > x:
            break
    if x > 1: pf.append(x)
    ans = y
    for p in pf:
        y = y//p
        ans += y
    return ans
            
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    return sum(nmoves(x) for x in a)

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