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

const ll MAX = 200005;
ll b[MAX + 1]{};
ll c[MAX + 1]{};

int main() {
    int N;
    cin >> N;
    ll A[N];
    ll sum = 0;
    set<int> s;
    for (int i = 0; i < N; i++) {
        cin >> A[i];
        b[A[i]]++;
        s.insert(A[i]);
        sum += A[i];
    }
    
    for (int i = 1; i <= MAX; i++) {
        c[i] = c[i - 1] + b[i]; 
    }
    ll ans = sum * N;

    for (ll i : s) {
        int t = i;
        if (i == 1) {
            ans -= b[1] * sum;
            continue;
        }
        for (ll k = 1; k < MAX; k++) {
            ll l = i * k - 1;
            ll r = min(MAX, i * (k + 1) - 1);
            if (l > MAX) break;
            ll e = (c[r] - c[l]) * k * i * b[i];
            ans -= e;
        }
    }
    cout << ans << "\n";
    return 0;
}