class SegTree():
    # 1-indexed
    def __init__(self, N, function, basement):
        self.n = N
        self.K = (self.n-1).bit_length()
        self.f = function
        self.b = basement
        self.seg = [basement]*(2**(self.K+1)+1)

    def update(self, k, value):
        X = 1 << (self.K)
        k += X
        self.seg[k] += value
        while k:
            k = k >> 1
            self.seg[k] = self.f(self.seg[k << 1], self.seg[(k << 1) | 1])

    def query(self, L, R):
        num = 1 << (self.K)
        L += num
        R += num
        vL = self.b
        vR = self.b
        while L < R:
            if L & 1:
                vL = self.f(vL, self.seg[L])
                L += 1
            if R & 1:
                R -= 1
                vR = self.f(self.seg[R], vR)
            L >>= 1
            R >>= 1
        return self.f(vL, vR)


def f(a, b):
    return a + b


n = int(input())
a = list(map(int, input().split()))

cash = [-1]*(210000)
segki = SegTree(210000, f, 0)
for v in a:
    segki.update(v, 1)


def get_quotient_sum(div):
    if cash[div] >= 0:
        return cash[div]
    res = 0
    for i in range(210000):
        if i*div >= 210000:
            break
        else:
            res += i*segki.query(div*i, min(div*(i + 1), 210000))
    cash[div] = res
    return res


ans = n*sum(a)
for i, v in enumerate(a):
    ans -= v*get_quotient_sum(v)
print(ans)