#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    int N;
    cin >> N;
    int A[N];
    ll cnt[200001];
    memset(cnt, 0, sizeof cnt);
    ll S = 0;
    rep(i, N) {cin >> A[i]; cnt[A[i]]++; S += A[i];}
    ll sum[200002];
    sum[0] = 0;
    rep(i, 200001) sum[i+1] = sum[i]+cnt[i];
    ll ans = 0;
    rep2(i, 1, 200000){
        ll tmp = S;
        for(ll j = 0; i*j <= 200000; j++){
            tmp -= (sum[min(200001LL, i*(j+1))]-sum[i*j])*j*i;
        }
        ans += tmp*cnt[i];
    }
    cout << ans << endl;
}