#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
using ll = long long;
struct DSU {
int n, comp;
vector<int> par, size;
void config(int _n) {
n = _n + 1;
comp = _n;
par.resize(n+1);
size.resize(n+1, 1);
for(int i=1; i<=n; i++) par[i] = i;
}
int get(int u) {
if(u == par[u]) return u;
return par[u] = get(par[u]);
}
bool uni(int u, int v) {
u = get(u), v = get(v);
if(u == v) return 0;
if(size[u] < size[v]) swap(u, v);
size[u] += size[v];
par[v] = u;
comp--;
return 1;
}
};
struct Edge {
int a, b, w;
bool operator<(Edge &e) { return w < e.w; }
};
int32_t main() {
ios_base::sync_with_stdio(false);
cout.tie(0); cin.tie(0);
int n;
ll ans = 0;
cin >> n;
vector<int> v(n);
for(int &x : v) cin >> x;
set<int> s;
for(int &x : v) s.insert(x);
v = vector<int>(s.begin(), s.end());
if(v[0] == 1 || v.size() == 1) {
cout << 0 << '\n';
return 0;
}
DSU dsu; dsu.config(n);
vector<Edge> edges;
n = v.size();
int mx = v[n-1];
for(int i=0; i<n; i++) {
int j = i;
for(int val=v[i]; val<=mx; val+=v[i]) {
int last = j;
while(j + 1 < n && v[j] < val) j++;
if(v[j] == v[i]) j++;
if(j != n && last != j) edges.push_back({ i, j, v[j] % v[i] });
}
}
sort(edges.begin(), edges.end());
for(Edge &e : edges)
if(dsu.uni(e.a, e.b)) ans += e.w;
cout << ans << '\n';
return 0;
}
