N = int(input())
A = sorted(list(map(int, input().split())))
ans = 0
now = 0
for i in range(N - 1, -1, -1):
    ans += (N - 1 - i) * A[i]

M = max(A)
D = [0] * (M + 1)
for a in A:
    D[a] += 1

Dc = [0] * (M + 2)
for i in range(M + 1):
    Dc[i + 1] = Dc[i] + D[i]


val = 0
for i in range(N):
    val += (i + 1) * A[i]

for a in A:
    v = 0
    for i in range(a, M + 1, a):
        v += (Dc[min(i + a, M + 1)] - Dc[i]) * (i // a)
    val -= a * v

print(ans - val)