from collections import Counter

N = int(input())
A = list(map(int, input().split()))
U = max(A)
S = sum(A)

B = [0] * (U + 1)
for a in A:
    B[a] += 1
for i in range(1, U+1):
    B[i] += B[i-1]

G = 0
for a in A:
    F = 0
    for i in range(1, U+1):
        L = i * a - 1
        R = (i + 1) * a - 1
        L = min(U, L)
        R = min(U, R)
        F += i * (B[R] - B[L])
        if R == U:
            break
    G += F * a

print(N * S - G)