#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 4e5 + 11;
int a[N];
ll cnt[N], sum[N];

int main() {
	ios :: sync_with_stdio(false);
	
	int n; cin >> n;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
		cnt[a[i]] ++;
		sum[a[i]] += a[i];
	}
	
	for(int i = 1; i < N; i ++) {
		cnt[i] += cnt[i - 1];
		sum[i] += sum[i - 1];
	}
	
	sort(a + 1, a + n + 1);
	ll ans = 0;
	
	map <int, ll> mem;
	for(int i = 1; i <= n; i ++) {
		int x = a[i];
		if(mem.find(x) != mem.end()) {
			ans += mem[x];
			continue;
		}
		
		ll tmp = 0;
		for(int j = 0; j + x < N; j += x) {
			ll s = sum[j + x - 1] - (j ? sum[j - 1] : 0);
			ll c = cnt[j + x - 1] - (j ? cnt[j - 1] : 0);
			tmp += s - c * j;
		}
		
		mem[x] = tmp;
		ans += tmp;
	}
	
	cout << ans << '\n';
}