#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
using i64 = long long;
#define rep(i,l,r) for (int i = (l); i <= (r); i++)
struct DSU {
vector<int> e;
void initSz(int n) {
e = vector<int>(n, -1);
}
int fr(int x) { return e[x] < 0 ? x : e[x] = fr(e[x]); }
bool unite(int x, int y) {
x = fr(x), y = fr(y);
if (x==y) return false;
if (e[x] > e[y]) swap(x,y);
e[x] += e[y];
e[y] = x;
return true;
}
};
signed main() {
int N; cin >> N;
vector<int> A(N);
for (int& i : A) cin >> i;
sort(all(A));
A.erase(unique(all(A)), A.end());
N = A.size();
int Largest = A.back();
vector<vector<pair<int,int>>> edges(Largest + 1);
if (N > 1e3) {
vector<int> lb(Largest+1);
for (int i = 0; i <= Largest; i++) {
lb[i] = lower_bound(A.begin() + lb[i-1], A.end(), i) - A.begin();
}
for (int i = 0; i < N-1; i++) {
edges[A[i+1] % A[i]].push_back({i, i+1});
for (int at = 2 * A[i]; at <= Largest; at += A[i]) {
int j = lb[at];
if (j < N) {
edges[A[j] % A[i]].push_back({i, j});
}
}
}
}
else {
for (int i = 0; i < N; i++) {
for (int j = i+1; j < N; j++) {
edges[A[j] % A[i]].push_back({i, j});
}
}
}
DSU dsu;
dsu.initSz(N);
long long res = 0;
for (int w = 0; w <= Largest; w++) {
for (auto item : edges[w]) {
int u = item.first, v = item.second;
res += w * dsu.unite(u, v);
}
}
cout << res;
return 0;
}
