from math import sqrt

def fac(n,arr):
    m,c = 0,0
    for i in range(2,int(sqrt(n))+1):
        if(n%i==0):
            c=1
            if(m<(n//i)*arr[i]):
                m = (n//i)*arr[i]
            if(m<(n//(n//i))*arr[n//i]):
                m = (n//(n//i))*arr[n//i]
    if(c==1):
        arr.append(m+1)
        return arr
    else:
        arr.append(n+1)
        return arr
    
t = int(input())
a = list(map(int,input().split()))
m = max(a)
arr = [0,1,3]
ans = 0
for i in range(3,m+1):
    arr = fac(i,arr)
for i in a:
    ans+=arr[i]
print(ans)