import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

# a>=b
# b-a%b
# b-(a-b*(a//b))
# b-a+b*(a//b)

mx = 200001
n = II()
aa = LI()

aa.sort()
ans = l = 0
cnt = [0]*mx
for i, a in enumerate(aa):
    cnt[a] += 1
    ans += l-a*i
    l += a

cs = [0]*(mx+1)
for i in range(mx): cs[i+1] = cs[i]+cnt[i]

for b in range(1, mx):
    if cnt[b] == 0: continue
    cur = -cnt[b]*(cnt[b]+1)//2
    for l in range(b, mx, b):
        r = min(l+b, mx)
        cur += cs[r]-cs[l]
        ans += cnt[b]*cur*l
        cur = 0

print(ans)