#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int main() {
	int n = ri();
	int a[n];
	for (auto &i : a) i = ri();
	std::sort(a, a + n);
	
#	define MAX 200000
	int sum[MAX + 2];
	memset(sum, 0, sizeof(sum));
	for (auto i : a) sum[i + 1]++;
	for (int i = 0; i <= MAX; i++) sum[i + 1] += sum[i];
	
	int64_t sum2[MAX + 2];
	memset(sum2, 0, sizeof(sum2));
	for (auto i : a) sum2[i + 1] += i;
	for (int i = 0; i <= MAX; i++) sum2[i + 1] += sum2[i];
	
	std::map<int, int64_t> cache;
	int64_t res = 0;
	for (int i = n; i--; ) {
		int64_t cur = 0;
		if (a[i] <= 500) {
			if (!cache.count(a[i])) {
				for (int j = i + 1; j < n; j++) cur += a[j] % a[i];
				cache[a[i]] = cur;
			} else cur = cache[a[i]];
		} else {
			for (int j = 1; a[i] * j <= MAX; j++) {
				int left = a[i] * j;
				int right = std::min(MAX + 1, a[i] * (j + 1));
				cur += (sum2[right] - sum2[left]) - (int64_t) left * (sum[right] - sum[left]);
			}
		}
		int ok_cnt = sum[MAX + 1] - sum[a[i] + 1];
		res += (int64_t) ok_cnt * a[i] - cur;
		// std::cerr << (int64_t) ok_cnt * a[i] - cur << std::endl;
		// std::cerr << a[i] << " " << cur << std::endl;
	}
	std::cout << res << std::endl;
	
	return 0;
}