n = int(input())
A = list(map(int, input().split()))
A.sort()

import bisect
ans = 0
memo = {}
for i, a in enumerate(A):
    if a in memo:
        ans -= memo[a]
        continue
    temp = 0
    l = i
    x = 1
    while l < n:
        r = bisect.bisect_left(A, (x+1)*a)
        temp += (r-l)*x*a
        l = r
        x += 1
    memo[a] = temp
    ans -= temp
ans += sum(A)*n
print(ans)