#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <utility>
#include <fstream>

using namespace std;
typedef long long ll;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
//constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353;
constexpr int MAX = 5000000;

const int N = 200000;
ll cnt[N * 3 + 100];
ll sum[N * 3 + 100];
int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	int n; cin >> n;
	vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i], cnt[a[i]]++;
	for (int i = 0; i <= N * 2 + 3; i++) sum[i + 1] = sum[i] + cnt[i];
	vector<ll> SA(N + 2);
	for (ll i = 1; i <= N; i++) {
		for (ll j = i; j <= N; j += i) {
			SA[i] += (sum[j + i] - sum[j]) * (j / i);
		}
	}

	ll res = accumulate(a.begin(), a.end(), 0LL) * n;
	for (int i = 0; i < n; i++) {
		res -= a[i] * SA[a[i]];
	}
	cout << res << endl;
	return 0;
}