import math
def primeFactors(n):
    p=[]
    while n % 2 == 0:
        p.append(2)
        n = n // 2
    for i in range(3,int(math.sqrt(n))+1,2):
        while n % i== 0:
            p.append(i)
            n = n // i
    if n > 2:
        p.append(n)
    return p    
        
n=int(input())
choc=list(map(int,input().split()))
s=0

def seq(n):
    if n==1:
        return 1
    else:
        prime=primeFactors(n)
        prime.sort(reverse=True)
        ans=1
        add=1
        for i in range(len(prime)):
            add*=prime[i]
            ans+=add
        return ans  
for org in choc:
    s+=seq(org)
    
print(s)