# include <bits/stdc++.h>
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y) for (ll i = x; i <= y; i ++)
#define FOr(i,x,y) for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to... Red
using namespace std;
inline bool isvowel (char c) {
c = tolower(c);
if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
return 0;
}
const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int n;
int sz[N];
int p[N];
int a[N];
ll ans = 0;
vector < pair < int, pair < int, int > > > v;
int get (int v) {
if (p[v] == v) {
return v;
}
return p[v] = get(p[v]);
}
bool uni (int u, int v) {
u = get(u), v = get(v);
if (u == v) return 0;
if (sz[u] > sz[v]) swap(u, v);
p[u] = v;
sz[v] += sz[u];
return 1;
}
int main () {
cin >> n;
For (i, 1, n) {
cin >> a[i];
p[i] = i;
sz[i] = 1;
}
sort(a + 1, a + n + 1);
n = unique(a + 1, a + n + 1) - a - 1;
For (i, 1, n) {
For (j, i + 1, n) {
if (i != j) {
v.pb(mp(min(a[i] % a[j], a[j] % a[i]), mp(i, j)));
}
}
}
sort(every(v));
for (auto it : v) {
if (uni(it.S.F, it.S.S)) {
// cout << it.S.F << ' ' << it.S.S << '\n';
ans += it.F;
}
}
cout << ans;
return Accepted;
}
// Coded By OB
