/**
* author: TomDev - Tran Hoang Quan
* created: 2026-05-07 23:30:07
* country: Vietnam - VNM
* ----------------------------------------------------------
* title: COCI 2016/2017 - Contest 6 - Sirni
* source: https://oj.vnoi.info/problem/coci1617_r6_sirni
* submission:
* status: WIP
* ----------------------------------------------------------
* tags:
* complexity:
* note:
**/
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#include <utility>
#include <numeric>
using namespace std;
// --- [ DEBUGGING & LOCAL CONFIG ] ---
#if __has_include("TomDev.h") && defined(LOCAL)
#include "TomDev.h"
#define dbg(x,i) cerr << "BreakPoint(" << i << ") -> " << #x << " = " << (x) << '\n'
#else
#define dbg(x,i)
#endif
#define NAH_I_WOULD_WIN 0
// --- [ MACROS ] ---
#define all(x,bonus) (x).begin()+(bonus),(x).end()
#define sub(x, st, ed) (std::begin((x)) + (st)), (std::begin((x)) + (ed) + 1)
#define filter(x,bonus) (x).erase(unique(std::begin((x))+(bonus), std::end((x))), std::end((x)))
#define rall(x,bonus) (x).rbegin(),(x).rend()-(bonus)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fi first
#define se second
#define eb emplace_back
#define sz(x) (int)(x).size()
// --- [ TYPES & ALIASES ] ---
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<long long,long long>;
using pld = pair<long double,long double>;
using pii = pair<int,int>;
using pill = pair<int,long long>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
using vpii = vector<pair<int,int>>;
using vpill = vector<pair<int,long long>>;
using vpll = vector<pair<long long,long long>>;
void setup(){
if(!fopen("coci1617_r6_sirni.INP", "r")) return;
freopen("coci1617_r6_sirni.INP", "r", stdin);
freopen("coci1617_r6_sirni.OUT", "w", stdout);
}
// ----------------------- [ CONFIG & CONSTANTS ] -----------------------
const int N = 1e5+2, MAXV = 1e7;
vpii cost[MAXV + 100];
int nxt[MAXV + 100];
int par[N], sz[N];
// ----------------------- [ FUNCTIONS ] -----------------------
void init(){
iota(sub(par,1,N-1),1);
fill(sub(sz,1,N-1), 1);
}
int root(int u){
if(u == par[u]) return u;
return par[u] = root(par[u]);
}
bool unite(int a, int b){
a = root(a), b = root(b);
if(a == b) return false;
if(sz[a] < sz[b]) swap(a,b);
sz[a] += sz[b];
par[b] = a;
return true;
}
// ----------------------- [ MAIN ] -----------------------
int main(){
fastio;
setup();
init();
int n;
cin >> n;
vi a(n+1);
for(int i = 1; i <= n; i++){
cin >> a[i];
}
sort(all(a,1));
filter(a,1);
n = sz(a)-1;
for(int i = 1; i <= n; i++){
nxt[a[i]] = i;
}
for(int i = MAXV-1; i >= 1; i--){
if(nxt[i] == 0) nxt[i] = nxt[i+1];
}
for(int i = 1; i < n; i++){
cost[a[i+1]%a[i]].eb(i,i+1);
for(int j = a[i]<<1; j <= MAXV; j += a[i]){
int pos = nxt[j];
if(pos) cost[a[pos]%a[i]].eb(i,pos);
}
}
ll ans = 0;
for(int i = 0; i < MAXV; i++){
for(const pii& p : cost[i]){
if(unite(p.fi,p.se)) ans += i;
}
}
cout << ans;
return NAH_I_WOULD_WIN;
}
