#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;
int N;
ll a[200000];
ll sum[200005];


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N;
    ll sum_all = 0;
    for(int i = 0; i < N; i++) {
        cin >> a[i];
        sum_all += a[i];
    }
    sort(a, a+N);
    ll ans = sum_all*N;
    for(int i = 1; i <= 200000; i++){
        for(int j = 0; i*j <= 200000; j++){
            // i*j <= x < i*(j+1)をもとめたい
            auto pl = lower_bound(a, a+N, i*j);
            auto pr = lower_bound(a, a+N, i*(j+1));
            ll cnt = pr-pl;
            sum[i] += cnt*j*i;
        }
    }
    for(int i = 0; i < N; i++){
        ans -= sum[a[i]];
        // cout << sum[a[i]] << endl;
    }
    cout << ans << endl;
}