import math
def primeFactors(n):
    l1=[]
    n1=n
    au=n1
    while n % 2 == 0:
        n=n/2
        l1.append(2)
    for i in range(3,int(math.sqrt(n))+1,2):
        while n % i== 0:
            n = n / i
            l1.append(i)
    if n > 2:
        l1.append(n)
    for j in l1:
        n1=n1/j
        au=au+n1
    return au
a=int(raw_input())
l=map(int,raw_input().strip().split())
su=0
for h in l:
    su=su+primeFactors(h)
print su