#include <bits/stdc++.h>
using namespace std;
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
template <class A, class B> bool minimize(A &a, B b) { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b) { if (a < b) { a = b; return true; } return false; }
struct disjoint_set {
vector <int> lab;
disjoint_set (int n = 0) : lab(n + 1, -1) {}
int find(int u) { return lab[u] < 0 ? u : lab[u] = find(lab[u]); }
bool merge(int u, int v) {
u = find(u); v = find(v);
if(u == v) return false;
if(lab[u] > lab[v]) swap(u, v);
lab[u] += lab[v];
lab[v] = u;
return true;
}
bool same_component (int u, int v) { return find(u) == find(v); }
int component_size(int i) { return -lab[find(i)]; }
};
const int MAXP = 1e7 + 5;
int dd[MAXP];
void you_make_it(void) {
int n; cin >> n; vector <int> p(n);
for (auto &x : p) cin >> x;
sort(p.begin(), p.end()); p.erase(unique(p.begin(), p.end()), p.end());
n = p.size();
long long ans = 0;
int cmp = n;
disjoint_set dsu(n);
memset(dd, -1, sizeof dd);
for (int i = 0; i < p.size(); ++i) dd[p[i]] = i;
for (int k = 0; k <= p.back() / 2; k++) {
int i = upper_bound(p.begin(), p.end(), k) - p.begin();
while(i < p.size()) {
for (int j = p[i] + k; j <= p.back(); j += p[i]) if(dd[j] != -1) {
if(dsu.merge(i, dd[j])) {
ans += k;
cmp--;
}
if(cmp == 1) {
cout << ans;
return;
}
}
i++;
}
}
}
signed main() {
#ifdef LOCAL
freopen("TASK.inp", "r", stdin);
freopen("TASK.out", "w", stdout);
#endif
auto start_time = chrono::steady_clock::now();
cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
you_make_it();
auto end_time = chrono::steady_clock::now();
cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;
return (0 ^ 0);
}
// Dream it. Wish it. Do it.
