#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001


int main() {	
	
	int n;
	cin>>n;
	
	vector<long long> cnt(200005,0);
	vector<long long> sum(200005,0);
	vector<int> t;
	rep(i,n){
		int a;
		cin>>a;
		cnt[a]++;
		sum[a] += a;
		t.push_back(a);
	}
	
	rep(i,cnt.size()-1){
		cnt[i+1] += cnt[i];
		sum[i+1] += sum[i];
	}
	
	sort(t.begin(),t.end());
	
	long long ans = 0;
	rep(i,t.size()){
		long long ct = t.size()-1-i;
		ct *= t[i];
		ans += ct;
		
		for(int j=1;j<=5000000;j++){
			int l = t[i] * j;
			int r = l+t[i];
			r = min(r,200004);
			if(l>=200001)break;
			
			long long S = sum[r-1] - sum[l-1];
			long long C = cnt[r-1] - cnt[l-1];
			C *= j;
			C *= t[i];
			S -= C;
			ans -= S;
			
		}
		
	}
	cout<<ans<<endl;
	
	
    return 0;
}