#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <functional>
#define _USE_MATH_DEFINES
#include <math.h>
#include <complex>
using namespace std;

//#include <atcoder/all>
//using namespace atcoder;

#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define RREP(i,n) for(int i = (int)n-1; i >= 0; i--)
#define LREP(i,n) for(LL i = 0; i < (LL)n; i++)

#define Vi vector<int>
#define Vl vector<long long>
#define LP pair<long long ,long long>
#define P pair<int, int>
#define T3 tuple<LL, LL, LL>
#define T4 tuple<LL, LL, LL, LL>
#define INF 1000000007
#define SIZE	300010
#define MOD 1000000007
typedef long long LL;

LL N, S;
LL A[SIZE], B[SIZE];

int main() {
	cin >> N;
	REP(i, N) cin >> A[i];
	REP(i, N) S += A[i];
	REP(i, N) B[A[i]] += 1;
	sort(A, A + N);

	LL ans = 0;
	for (LL i = 1; i < SIZE; i++) {
		LL a = i, cost = S;
		for (LL l = 0; l <= A[N - 1]; l += a) {
			LL r = l + a;
			LL cnt = lower_bound(A, A + N, r) - lower_bound(A, A + N, l);
			cost -= l * cnt;
		}
		ans += cost * B[i];
	}
	cout << ans << endl;
}