#include <bits/stdc++.h>
#define endl '\n'

using namespace std;

const int maxn = 1e5 + 3;
const long long inf = 1e18;

int n;
bool is[maxn];
long long ans;
vector <int> mins[maxn];

vector <int> get_divisors(int x) {
    vector <int> ans;
    for (int i = 1; i * i <= x; i++)
        if (x % i == 0) {
            ans.push_back(i);
            if (i * i != x)
                ans.push_back(x / i);
        }

    return ans;
}

int get_minimum(int idx) { 
    while (!mins[idx].empty() && !is[mins[idx].back()])
        mins[idx].pop_back();

    return mins[idx].empty() ? -1 : mins[idx].back();
}

void add_num(int x) {
    vector <int> d = get_divisors(x); 
    for (auto i: d)
        mins[i].push_back(x);
}

void read() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;

        if (is[x]) {
            ans += x;
            continue;
        }  

        is[x] = true;
    } 
}

struct edge {
    int from, to;
    long long w;

    edge(int _from, int _to, long long _w) {from = _from, to = _to, w = _w;}
    bool operator < (const edge &other) const {
        return w > other.w;
    }
};

void add_next(int x, int d, priority_queue <edge> &pq) {
    auto temp = get_minimum(d);
    if (temp == -1)
        return;

    pq.push(edge(x, temp, (long long)x * temp / d));
}

void add_edges(int x, priority_queue <edge> &pq) {
    auto d = get_divisors(x);
    for (auto i: d)
        add_next(x, i, pq);
}

edge get_best_edge(priority_queue <edge> &pq) {
    for (;;) {
        auto e = pq.top();
        pq.pop();

        if (!is[e.to]) {
            add_next(e.from, __gcd(e.from, e.to), pq);
            continue;
        }

        return e;
    } 
}

void solve() {
    int left = 0;
    for (int i = maxn-1; i >= 1; i--)
        if (is[i])
            add_num(i), left++;

    for (int i = 1; i < maxn; i++)
        if (is[i]) {
            is[i] = false;
            priority_queue <edge> pq;
            add_edges(i, pq);
            left--;
            while (left) {
                auto e = get_best_edge(pq);
                ans += e.w;
                is[e.to] = false;
                left--;

                add_edges(e.from, pq);
                add_edges(e.to, pq);
            }

            break;
        }

    cout << ans << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    read();
    solve();
}