#include<iostream>
#include<algorithm>
#include<atcoder/fenwicktree>
using namespace std;
int N;
int A[2<<17];
int main()
{
	cin>>N;
	for(int i=0;i<N;i++)cin>>A[i];
	sort(A,A+N);
	atcoder::fenwick_tree<int>BIT(200001);
	atcoder::fenwick_tree<long>SUM(200001);
	long ans=0;
	for(int i=N;i--;)
	{
		ans+=(long)A[i]*(N-i-1);
		for(int k=A[i];k<=200000;k+=A[i])
		{
			int r=min(k+A[i],200001);
			ans-=SUM.sum(k,r)-BIT.sum(k,r)*(long)k;
		}
		BIT.add(A[i],1);
		SUM.add(A[i],A[i]);
	}
	cout<<ans<<endl;
}