def sort(l,ar):
    for i in range(l):
        for j in range(i+1,l):
            if ar[j]>ar[i]:
                ar[j],ar[i]=ar[i],ar[j]
    return ar        

def prime(w):
    ws=w
    pr=[]
    for i in range(2,ws+1):
        while True:
            if w%i==0:
                pr.append(i)
                w=w/i
            else:
                break
        if w==1:
            break
    return sort(len(pr),pr)

def longestSequence(n,a):
    sum1 = 0
    for i in range(n):
        pr=prime(a[i])
        for j in range(len(pr)):
            prod=1
            for k in range(j+1):
                prod=prod*pr[k]
            sum1+=prod
    return sum1+n

n = int(input().strip())
a = list(map(int, input().strip().split(' ')))
result = longestSequence(n,a)
print(result)