#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++)
const int MaxN = 1e5;
const int MaxA = 1e6 + 1;
int N, A[MaxN];
struct DSU {
int e[MaxN];
void initSz(int n) {
memset(e, -1, n * sizeof(int));
}
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;
}
};
DSU dsu;
void sub1() {
sort(A, A + N);
N = unique(A, A + N) - A;
vector<array<int,3>> edges;
rep(i, 0, N-1) {
rep(j, i+1, N-1) {
edges.push_back({A[j] % A[i], i, j});
}
}
sort(all(edges));
dsu.initSz(N);
long long res = 0;
for (int i = 0; i < edges.size(); i++) {
int w = edges[i][0];
int u = edges[i][1];
int v = edges[i][2];
if (dsu.unite(u, v)) res += w;
}
cout << res;
}
void sub2() {
sort(A, A + N);
N = unique(A, A + N) - A;
vector<array<int,3>> edges;
for (int i = 0; i < N; i++) {
for (int mul = A[i]; mul <= MaxA; mul += A[i]) {
int j = mul == A[i] ? upper_bound(A, A + N, mul) - A : lower_bound(A, A + N, mul) - A;
if (j < N) {
edges.push_back({A[j] % A[i], i, j});
}
}
}
sort(all(edges));
dsu.initSz(N);
long long res = 0;
for (int i = 0; i < edges.size(); i++) {
int w = edges[i][0];
int u = edges[i][1];
int v = edges[i][2];
if (dsu.unite(u, v)) res += w;
}
cout << res;
}
signed main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N <= 2e3) {
sub1();
}
else {
sub2();
}
return 0;
}
