// [COCI2016-2017#6] Sirni
#include <bits/stdc++.h>
using namespace std;
const int NN = 1e5 + 4;
#define _for(i, a, b) for (int i = (a); i < (int)(b); ++i)
int P[NN], pa[NN];
int find_set(int x) { return pa[x] == x ? x : pa[x] = find_set(pa[x]); }
struct Edge {
int u, v, w;
bool operator<(const Edge& e) const { return w < e.w; }
};
int main() {
ios::sync_with_stdio(false), cin.tie(0);
// vector<Edge> es;
int n;
cin >> n;
_for(i, 0, n) cin >> P[i], pa[i] = i;
sort(P, P + n), n = unique(P, P + n) - P;
unordered_map<int, vector<pair<int, int>>> EM;
set<int> ws;
int maxw = -1;
_for(i, 0, n) for (int p = P[i], k = 1; k * p <= P[n - 1]; ++k) {
int j = lower_bound(P + i + 1, P + n, k * p) - P;
if (j < n && P[j] / p == k) {
int w = P[j] % p;
ws.insert(w), maxw = max(w, maxw), EM[w].push_back({i, j});
}
}
long long sw = 0;
for (int w : ws)
for (const auto& e : EM[w]) {
int u = find_set(e.first), v = find_set(e.second);
if (u != v) sw += w, pa[u] = v;
}
// sort(es.begin(), es.end());
// for (const Edge& e : es) {
// int u = find_set(e.u), v = find_set(e.v);
// if (u != v) sw += e.w, pa[u] = v;
// }
cout << sw << endl;
return 0;
}
