#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

int n;
ll a[200002];
ll cnt[400002];
void solve() {
    cin >> n;

    ll ans = 0;
    for (int i = 1;i <= n;i++) {
        int x;
        cin >> x;
        cnt[x]++;
        ans += (ll)n * x;
    }

    for (int i = 1;i <= 400001;i++) cnt[i] += cnt[i - 1];

    for (int mod = 1;mod <= 200000;mod++) {
        ll mod_cnt = cnt[mod] - cnt[mod - 1];
        for (int k = 0;mod * k <= 200000;k++) {
            ll c = cnt[(k + 1) * mod - 1];
            if (k * mod - 1 >= 0) c -= cnt[k * mod - 1];
            ans -= c * mod_cnt * (mod * k);
        }
    }
    cout << ans;
}

/*
a%b = a - ky
??k

??-ky?
ky<=a<(k+1)y
*/
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}