#BIT plus ver
class BITplus:
    def __init__(self,N):
        self.N = N
        self.bit = [0] * (self.N+1)
    def add(self,i,x):
        while i <= self.N:
            self.bit[i] += x
            i += i & -i
    def fold(self,i):
        ans = 0
        while i > 0:
            ans += self.bit[i]
            i -= i & -i
        return ans
    def lb(self,w):
        if w <= 0:return 0
        x = 0
        k = 1
        while k <= self.N:
            k <<= 1
        k >>= 1
        while k:
            if x + k <= self.N and self.bit[x+k] < w:
                w -= self.bit[x+k]
                x += k
            k >>= 1
        return x + 1

    #サイズ N の配列をいれる
    def build(self,seq):
        bit = self.bit
        N = self.N
        for i in range(N):
            bit[i+1] = seq[i]
        for i in range(1,N+1):
            if i + (i & -1) <= N:
                bit[i + (i & -i)] += bit[i]

N = int(input())
A = list(map(int,input().split()))
A.sort()
C = A[-1]
bit = BITplus(C)
bitn = BITplus(C)
ans = 0
for i in range(N):
    ans += A[i] * (N - 1 - i)

for a in reversed(A):
    if a == 1:break
    for k in range(1,C // a + 1):
        s = bit.fold(min(C,a * k + a - 1)) - bit.fold(a * k)
        n = bitn.fold(min(C,a * k + a - 1)) - bitn.fold(a * k)
        #print(s,n,min(C,a * k + a - 1),a * k)
        #print(s - n * a * k)
        ans -= s - n * a * k
    bit.add(a,a)
    bitn.add(a,1)
print(ans)