#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
	int n; cin>>n;
	int c[200020]={};
	ll s[200020]={};
	int a[200020];
	for(int i=0; i<n; i++){
		cin>>a[i];
		c[a[i]]++;
	}
	for(int i=0; i<=200010; i++) s[i+1]=s[i]+c[i];
	ll sum=0;
	for(int i=1; i<=200000; i++){
		if(c[i]==0) continue;
		ll sum1=0;
		for(int j=1; j<=200000/i; j++){
			sum1+=(s[min(200010, (j+1)*i)]-s[j*i])*j;
		}
		sum+=sum1*i*c[i];
	}
	ll ans=0;
	for(int i=0; i<n; i++){
		ans+=a[i];
	}
	ans*=n;
	ans-=sum;
	cout<<ans<<endl;
	return 0;
}