#include "bits/stdc++.h"
using namespace std;
#ifdef duc_debug
#include "bits/debug.h"
#else
#define debug(...)
#endif
const int maxn = 1e5 + 5;
const int N = 1e7 + 7;
int n;
vector<int> value[N];
int lab[maxn];
int nxt[N];
int find(int u) {
return lab[u] < 0 ? u : lab[u] = find(lab[u]);
}
bool is_joined(int u, int v) {
u = find(u), v = find(v);
if(u == v) return 1;
if(lab[u] > lab[v]) swap(u, v);
lab[u] += lab[v];
lab[v] = u;
return 0;
}
struct edge {
int u, v, w;
bool operator<(const edge &o) {
return w < o.w;
}
};
vector<edge> e;
void solve() {
cin >> n;
vector<int> a;
for(int i = 1; i <= n; ++i) {
int x; cin >> x;
a.push_back(x);
lab[i] = -1;
value[x].push_back(i);
}
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());
for(int i = a.back(); i; --i) {
nxt[i] = (value[i].empty() ? nxt[i + 1] : i);
}
for(int i = 1; i < (int)a.size(); ++i) {
if(value[a[i]].size() and value[a[i - 1]].size())
e.push_back({value[a[i]][0], value[a[i - 1]][0], a[i] % a[i - 1]});
}
for(int i = 0; i < (int)a.size(); ++i) {
for(int j = a[i]; j <= a.back(); j += a[i]) {
int val = nxt[j];
if(value[val].empty()) continue;
for(auto pos:value[val]) {
if(pos == value[a[i]][0]) continue;
e.push_back({value[a[i]][0], pos, val % a[i]});
}
}
}
sort(e.begin(), e.end());
long long ans = 0;
for(auto i:e) {
if(!is_joined(i.u, i.v)) {
ans += i.w;
}
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
