#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
const int mx = 1e7;
int n, a[maxn], nxt[mx + 1];
vector<pair<int, int>> edges[mx + 1];
class DisjointSets {
private:
vector<int> e;
public:
DisjointSets(int n) : e(n, -1) { }
int find(int x) {
return e[x] < 0 ? x : (e[x] = find(e[x]));
}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return false;
if (-e[x] > -e[y]) swap(x, y);
e[y] += e[x];
e[x] = y;
return true;
}
bool connected(int x, int y) {
return find(x) == find(y);
}
};
int main() {
// freopen("main.in", "r", stdin);
// freopen(".out", "w", stdout);
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
int p = 1;
for(int i = 1; i < n; i++) if(a[i] != a[i - 1]) a[p] = a[i], p++;
n = p;
for(int i = 0; i < n; i++) nxt[a[i]] = -(i + 1);
for(int i = a[n-1] - 1; i >= 0; i--) {
if(nxt[i] == 0){
nxt[i] = nxt[i + 1];
if (nxt[i] < 0) nxt[i] = -(nxt[i]);
}
}
for(int i = 0; i < n - 1; i++){
for(int j = a[i]; j <= a[n - 1]; j+=a[i]) {
int nt;
if(j == a[i]) nt = (nxt[a[i]] < 0 ? -nxt[a[i] + 1] : nxt[a[i]+1]);
else nt = (nxt[j] < 0 ? -nxt[j] : nxt[j]);
if(a[nt - 1] >= a[i] + j) continue;
edges[a[nt - 1] - j].push_back({i+1, nt});
}
}
long long ans = 0;
DisjointSets dsu(n);
for(int i = 0; i < a[n-1]; i++){
for(auto &edge: edges[i]){
if(!dsu.connected(edge.first - 1, edge.second - 1)){
dsu.unite(edge.first - 1, edge.second - 1);
ans += i;
}
}
}
cout << ans << endl;
}
