#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = unsigned __int128_t;
using mint = atcoder::static_modint<998244353>;
const int mod = 998244353;
#include <chrono>
mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1};
int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
template<class T>
bool chmin(T& a, const T& b){
    if (b < a){
        a = b;
        return true;
    }
    else { 
        return false;
    }
}
template<class T> 
bool chmax(T& a, const T& b){
    if (a < b){
        a = b;
        return true;
    }
    else {
        return false;
    }
}

void solve(){
    int n;
    cin >> n;
    vector<ll> a(n);
    vector<ll> cnt(200001);
    for (int i = 0; i < n; i++){
        cin >> a[i];
        cnt[a[i]]++;
    }
    vector<ll> dp(200001);
    vector<ll> sum(200001);
    for (int i = 1; i <= 200000; i++){
        sum[i] = sum[i - 1] + cnt[i]; 
        dp[i] = dp[i - 1] + cnt[i] * i;
    }
    ll ans = 0;
    for (int i = 1; i <= 200000; i++){
        for (int j = 1; j <= (200000 + i - 1) / i; j++){
            ans += (dp[min(200000, i * j - 1)] - dp[i * (j - 1)] - (sum[min(200000, i * j - 1)] - sum[i * (j - 1)]) * (j - 1) * i) * cnt[i]; 
        }
    }
    cout << ans << '\n';
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;   
    while(t--){
        cout << fixed << setprecision(15);          
        solve();
    }   
}