#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; i < n; i++) {
        int l = 0;
        for (int j = 0; j*a[i] <= a[n - 1] && l < n; j++) {
            int r = lower_bound(a.begin(), a.end(), (j + 1)*a[i]) - a.begin();
            ans += (suff[l] - suff[r]) - (r - l) * j * a[i];
            l = r;
        }
    }

    cout << ans << endl;
}