N=int(input())
A=list(map(int, input().split()))
A.sort()
S=[0]*(max(A)+1)
for a in A:
    S[a]+=1
C=[0]
for a in S:
    C.append(C[-1]+a)

res=N*sum(A)
for i in range(N):
    l,r=0,A[i]-1
    k=0
    while l+A[i]<=max(A):
        l+=A[i]
        r+=A[i]
        k+=1
        res-=(C[min(r+1,max(A)+1)]-C[l])*k*A[i]

print(res)