#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
void Main()
{
	int N;
	cin >> N;
	const int M = (int)2e5;
	vector<int> cnt(M + 1);
	for(int i = 0;i < N;i++)
	{
		int a;
		cin >> a;
		cnt[a]++;
	}
	vector<long long> S(M + 1);
	for(int i = 1;i <= M;i++)
	{
		S[i] = S[i - 1];
		S[i] += (long long) cnt[i] * i;
	}
	long long ans = 0;
	for(int i = 1;i <= M;i++) if(cnt[i])
	{
		//a = b * (a / b) + a % b
		//a % b = a - b * (a / b)
		long long cur = 0;
		cur += (long long) N * i;
		for(int j = 1;j * j <= i;j++)
		{
			cur -= (long long) j * (i / j) * cnt[j];
			if(j != i / j)
			{
				long long sum = S[i / j] - S[i / (j + 1)];
				cur -= sum * j;
			}
		}
		ans += cur * cnt[i];
	}
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}