#include <bits/stdc++.h>
#define MAXN 100000
using namespace std;
typedef pair<int, int> pi;
const int MAXP = 1e7;
int N;
set<int> cards;
vector<pi> edges[MAXP + 5]; // PQ of edges
priority_queue<pair<int, pi>> PQ;
int parent[MAXN + 5]; // initialize parent[i] = i
int findRoot(int a) {
return parent[a] = (parent[a] == a ? a : findRoot(parent[a]));
}
int join(int a, int b) {
a = findRoot(a); b = findRoot(b);
if (a == b) return 0;
parent[a] = b;
return 1;
}
int card[MAXN + 5]; // value for each card ID
map<int, int> ID; // card value to card ID
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
int P;
cin >> P;
cards.insert(P);
}
N = 0;
for (int c : cards) {
card[N++] = c;
}
for (int i = 0; i < N;i++) {
int s = i + 1;
for (int j = card[i]; j < MAXP; j += card[i]) {
while (s < N && card[s] < j) s++;
if (s < N) edges[card[s] % card[i]].emplace_back(i, s);
}
}
iota(parent, parent + N, 0);
long long ans = 0;
for (int p = 0; p < MAXP;p++) {
for (auto curr : edges[p]) {
int f = curr.first;
int s = curr.second;
if (join(f, s))ans += p;
}
}
cout << ans<<endl;
}
