/*
# https://yukicoder.me/problems/no/1233

import bisect
from itertools import accumulate
from collections import Counter
N = int(input())
A = list(map(int,input().split()))
A.sort()

S = [0] + list(accumulate(A))

ans = 0
# (小,大)
c = Counter(A)
SUM = 0
for k,v in sorted(c.items()):
    ans += SUM * v
    SUM += k*v

# (大,小)
v = 0
for i in range(N):
    left = bisect.bisect_left(A,A[i])
    for j in range(1,10**18):
        if(A[i]*j > A[-1]):break
        right = bisect.bisect_left(A,A[i]*(j+1))
        v += (S[right] - S[left]) - A[i] * j * (right-left)
        left = right
print(ans+v)
*/

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    vector<long long> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];
    sort(A.begin(), A.end());

    // prefix sum (accumulate)
    vector<long long> S(N+1, 0);
    for (int i = 0; i < N; i++) {
        S[i+1] = S[i] + A[i];
    }

    long long ans = 0;

    // Counter + sorted(c.items())
    map<long long,long long> c;
    for (auto x : A) c[x]++;
    long long SUM = 0;
    for (auto &kv : c) {
        long long k = kv.first, v = kv.second;
        ans += SUM * v;
        SUM += k * v;
    }

    // (大,小)
    long long v = 0;
    for (int i = 0; i < N; i++) {
        long long left = lower_bound(A.begin(), A.end(), A[i]) - A.begin();
        for (long long j = 1;; j++) { // range(1,10**18)
            if (A[i] * j > A.back()) break;
            long long right = lower_bound(A.begin(), A.end(), A[i] * (j+1)) - A.begin();
            v += (S[right] - S[left]) - A[i] * j * (right - left);
            left = right;
        }
    }

    cout << ans + v << "\n";
}