N = int(input())
A = list(map(int, input().split()))
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]


ans = N * sum(A)
memo = [-1] * (M + 1)
for a in A:
    if memo[a] != -1:
        ans -= memo[a]
        continue
    v = 0
    for i in range(a, M + 1, a):
        v += (Dc[min(i + a, M + 1)] - Dc[i]) * (i // a)
    ans -= a * v
    memo[a] = a * v

print(ans)