#include <bits/stdc++.h>

using namespace std; 

const int N = 2e5 + 5;

int t, n;

long long a[N], ans, maxi = 0, sum[N];

bool vis[N];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		vis[a[i]] = true;
		maxi = max(maxi, a[i]);
		sum[a[i]] += a[i];
		ans += a[i];
	}
	for (int i = 1; i <= maxi + 1; i++) {
		sum[i] += sum[i - 1];
	}
	ans *= n;
	for (int i = 1; i <= maxi; i++) {
		if (!vis[i]) {
			continue;
		}
		for (long long l = 1, r = 0; l <= i; l = r + 1) {
			r = i / (i / l);
			ans -= (i / l) * (sum[r] - sum[l - 1]);
		}
	}
	cout << ans;
	return 0;
}