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

def binary_search(l, r, minimize):
    if minimize: l -= 1
    else: r += 1
    while l+1 < r:
        m = (l+r)//2
        if ok(m) ^ minimize: l = m
        else: r = m
    if minimize: return r
    return l

def ok(m):
    return a//aa[m] < f

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

n = II()
aa = LI()

aa.sort()
ans = l = 0
for i, a in enumerate(aa):
    ans += l-a*i
    l += a

cs = [0]*(n+1)
for i in range(n): cs[i+1] = cs[i]+aa[i]

for i, a in enumerate(aa):
    l = 0
    while l < i:
        f = a//aa[l]
        r = binary_search(l+1, i, True)
        ans += (cs[r]-cs[l])*f
        l = r

print(ans)