#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
    ll n;cin >> n;
    vector<ll> v(200001),a(n),memo(200001,-1);
    rep(i,n){
        cin >> a[i];
        v[a[i]]++;
    }
    ll sum=0;
    vl cum(200010),cnt(200010);
    rep(i,200001)cum[i+1]+=cum[i]+i*v[i];
    rep(i,200001)cnt[i+1]+=cnt[i]+v[i];
    //rep(i,10)cout<< cum[i] <<" " << cnt[i] <<endl;
    rep(i,n){
        ll p=a[i];
        if(memo[p]!=-1){sum+=memo[p];continue;}
        memo[p]=0;
        for(ll j=0;j*p+p<200001;j++){
            memo[p]+=cum[j*p+p]-cum[j*p]-j*p*(cnt[j*p+p]-cnt[j*p]);
        }
        sum+=memo[p];
        //cout << sum<<endl;
    }
    cout << sum <<endl;
}