from bisect import bisect_left

n = int(input())
*a, = map(int, input().split())
a.sort()

s = [0]
for ai in a:
    s.append(s[-1]+ai)

ans = 0
cache = {1: 0}
for i, ai in enumerate(a):
    ans += s[bisect_left(a, ai)]

    if ai not in cache:
        j = i
        cache[ai] = s[-1] - s[j]
        for aj in range(ai, a[-1]+1, ai):
            k = bisect_left(a, aj+ai)
            cache[ai] -= aj * (k-j)
            j = k
    ans += cache[ai]

print(ans)