#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int long long
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define f first
#define s second
#define mkp make_pair
#define pii pair<int, int>
struct DSU {
vector<int> e;
DSU(int N) { e = vector<int>(N, -1); }
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool same_set(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) {
x = get(x), y = get(y);
if (x == y) return false;
if (e[x] > e[y]) swap(x, y);
e[x] += e[y];
e[y] = x;
return true;
}
};
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
vector<int> v(n);
for(int i = 0; i < n; i++){
cin >> v[i];
}
sort(all(v));
v.erase(unique(all(v)), v.end());
n = sz(v);
vector<int> nxt(v.back() + 1, -1);
for(int i = 0; i < n; i++){
nxt[v[i]] = i;
}
for(int i = v.back() - 1; i >= 0; i--){
if(nxt[i] == -1){
nxt[i] = nxt[i + 1];
}
}
vector<vector<pii>> links(v.back() + 1);
for(int i = 0; i < n - 1; i++){
links[v[i + 1] % v[i]].pb(mkp(i, i + 1));
for(int j = 2 * v[i]; j <= v.back(); j += v[i]){
links[v[nxt[j]] % v[i]].pb(mkp(nxt[j], i));
}
}
DSU dsu(n);
ll ans = 0;
for(int i = 0; i <= v.back(); i++){
for(auto x : links[i]){
if(dsu.unite(x.f, x.s)){
ans += 1LL * i;
}
}
}
cout << ans << '\n';
return 0;
}
