# https://yukicoder.me/problems/no/1233

import bisect
from itertools import accumulate
from collections import Counter
N = int(input())
A = list(map(int,input().split()))
A.sort()

S = [0] + list(accumulate(A))

ans = 0
# (小,大)
c = Counter(A)
SUM = 0
for k,v in sorted(c.items()):
    ans += SUM * v
    SUM += k*v

# (大,小)
v = 0
for i in range(N):
    left = bisect.bisect_left(A,A[i])
    for j in range(1,10**18):
        if(A[i]*j > A[-1]):break
        right = bisect.bisect_left(A,A[i]*(j+1))
        v += (S[right] - S[left]) - A[i] * j * (right-left)
        left = right
print(ans+v)