#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
typedef long long int ull;
#define MP make_pair
using namespace std;
using namespace atcoder;
typedef pair<ll, ll> P;
// const ll MOD = 998244353;
const ll MOD = 1000000007;
// using mint = modint998244353;
using mint = modint1000000007;
const double pi = 3.1415926536;
const int MAX = 2000005;
long long fac[MAX], finv[MAX], inv[MAX];
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll n) {
    ll ret = 0;
    while (n) {
        n /= 10;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}

vector<ll> compress(vector<ll> v) {
    // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] 
    vector<ll> u = v;
    sort(u.begin(), u.end());
    u.erase(unique(u.begin(),u.end()),u.end());
    map<ll, ll> mp;
    for (int i = 0; i < u.size(); i++) {
        mp[u[i]] = i;
    }
    for (int i = 0; i < v.size(); i++) {
        v[i] = mp[v[i]];
    }
    return v;
}

vector<pair<ll, P>> e;
int main() {
    int n;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a, a + n);
    vector<int> v;
    ll ans = 0;
    v.push_back(a[0]);
    for (int i = 1; i < n; i++) {
        if (a[i] == a[i - 1]) ans += a[i];
        else v.push_back(a[i]);
    }
    // v は　被りなし
    int m = v.size();
    int id[100001];
    for (int i = 0; i < 100001; i++) id[i] = -1;
    for (int i = 0; i < m; i++) id[v[i]] = i;
    for (int i = 1; i <= 100000; i++) {
        vector<int> id_lis;
        for (int j = 1; i * j <= 100000; j++) {
            if (id[i * j] != -1) id_lis.push_back(id[i * j]);
        }
        for (int j = 1; j < id_lis.size(); j++) {
            ll cst = lcm(v[id_lis[0]], v[id_lis[j]]);
            e.push_back({cst, {id_lis[0], id_lis[j]}});
        }
    }
    sort(e.begin(), e.end());
    dsu d(m);
    for (auto x : e) {
        ll c = x.first;
        int U = x.second.first;
        int V = x.second.second;
        if (d.same(U, V)) ;
        else {
            d.merge(U, V);
            ans += c;
        }
    }
    cout << ans << endl;
    return 0;
}