#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))

using namespace std;
typedef pair<llint, llint> P;

llint n;
llint a[200005], cnt[200005];
llint dif[400005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i], cnt[a[i]]++;
	
	for(int i = 2; i <= 200000; i++){
		for(int j = 0; j*i <= 200000; j++){
			dif[i*j+1] += cnt[i];
			dif[(j+1)*i] -= cnt[i]*i;
			dif[(j+1)*i+1] += cnt[i]*(i-1);
		}
	}
	for(int i = 1; i <= 200000; i++) dif[i] += dif[i-1];
	for(int i = 1; i <= 200000; i++) dif[i] += dif[i-1];
	
	
	llint ans = 0;
	for(int i = 1; i <= 200000; i++) ans += dif[i] * cnt[i];
	cout << ans << endl;
	
	return 0;
}