import bisect
U = 2 * 10 ** 5

N = int(input())
A = list(map(int, input().split()))
A.sort()
B = [0] * (N + 1)
for i, a in enumerate(A, 1):
    B[i] = a + B[i-1]

ans = 0
s = A[0]
for i in range(1, N):
    if A[i] != A[i-1]:
        ans += s
    s += A[i]


for i, a in enumerate(A):
    for i in range(1, U+1):
        l = bisect.bisect_left(A, i * a)
        if l >= N:
            break
        r = bisect.bisect_left(A, (i + 1) * a)
        ans += B[r] - B[l]
        ans -= a * i * (r - l)

print(ans)