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

#define int ll
using ll = long long;

const int MOD = 1e9 + 7;

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);

    int n; cin >> n;
    vector<int> a(n);
    for (auto &i : a) cin >> i;

    sort(a.begin(), a.end());

    vector suff = a;
    suff.push_back(0);
    for (int i = n - 1; i >= 0; i--) {
        suff[i] += suff[i + 1];
    }

    int ans = 0;
    for (int i = 0, j = 0; i < n; i = j) {
        while (j < n && a[i] == a[j]) j++;
        int l = 0;
        for (int k = 0; k*a[i] <= a[n - 1] && l < n; k++) {
            int r = lower_bound(a.begin(), a.end(), (k + 1)*a[i]) - a.begin();
            ans += ((suff[l] - suff[r]) - (r - l) * k * a[i]) * (j - i);
            l = r;
        }
    }

    cout << ans << endl;
}