import bisect

N = int(input())
A = list(map(int, input().split()))
A.sort()
U = A[-1]
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 a in A[::-1]:
    if a == 1:
        break
    x = a
    while x < U:
        y = x + a
        l = bisect.bisect_right(A, x)
        r = bisect.bisect_left(A, y)
        ans += B[r] - B[l]
        ans -= x * (r - l)
        x = y

print(ans)