#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

const int M=200005;
int n,a[200010],z[200010];
ll S[200010],T[200010];

void solve(){
    cin >> n;
    rep(i,n) {
        cin >> a[i];
        z[a[i]]++;
    }
    rep(i,M){
        S[i+1]=S[i]+z[i+1];
        T[i+1]=T[i]+z[i+1]*(ll)(i+1);
    }
    ll ans=0;
    Rep(i,1,M){
        ll res=0;
        rep(j,M){
            if(i*(j+1)-1>M){
                res+=T[M]-T[i*j-1];
                res-=(ll)j*(S[M]-S[i*j-1])*i;
                break;
            }
            res+=T[i*(j+1)-1]-T[i*j-1];
            res-=(ll)j*(S[i*(j+1)-1]-S[i*j-1])*i;
        }
        ans+=z[i]*res;
    }
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}