#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/fenwicktree>
using namespace atcoder;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000


int main(){

	vector<long long> A(200001,0LL);
	int N;
	cin>>N;
	rep(i,N){
		int a;
		cin>>a;
		A[a] ++;
	}
	
	fenwick_tree<long long> B0(A.size());
	rep(i,A.size())B0.add(i,A[i]);
	
	fenwick_tree<long long> B1(A.size());
	rep(i,A.size())B1.add(i,A[i]*i);
	
	long long ans = 0LL;
	
	rep(i,A.size()){
		if(A[i]==0)continue;
		long long temp = 0LL;
		for(int j=0;j<A.size();j+=i){
			int r  =min(j+i,(int)A.size());
			temp += B1.sum(j,r) - B0.sum(j,r) * j;
		}
		
		ans += temp * A[i];
	}
	
	cout<<ans<<endl;

	return 0;
}