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

using namespace std;

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

int n;
bool is[maxn];
long long ans;
deque <int> taken[maxn], not_taken[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;
}

void add_num(int x) {
    vector <int> d = get_divisors(x); 
    for (auto i: d)
        not_taken[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;
    }


};

ostream &operator << (ostream &out, const edge &e) {
    out << "edge from " << e.from << " to " << e.to << " with weight " << e.w << endl;
    return out;
}

void add_edges(int x, priority_queue <edge> &pq) {
    auto d = get_divisors(x);
    for (auto i: d)
        if (i > bucket)
            for (auto j: not_taken[i])
                if (is[j])
                    pq.push(edge(x, j, (long long)x * j / i));
}

edge get_best_edge(priority_queue <edge> &pq) { 
    while (!pq.empty()) {
        auto e = pq.top();
        if (!is[e.to]) {
            pq.pop();
            continue;
        }

        return e;
    } 

    return edge(-1, -1, inf);
}

edge get_single(int idx) {
    while (!not_taken[idx].empty() && !is[not_taken[idx].front()]) {
        not_taken[idx].pop_front();
        taken[idx].push_back(idx);
    }

    if (not_taken[idx].empty() || taken[idx].empty())
        return edge(-1, -1, inf);

    return edge(not_taken[idx].front(), taken[idx].front(), (long long)not_taken[idx].front() * taken[idx].front() / idx);
}

edge get_multiple() {
    edge ans = {-1, -1, inf};
    for (int i = 1; i <= bucket; i++)
        ans = max(ans, get_single(i));

    return ans;
}

void solve() {
    int left = 0;
    for (int i = 1; i< maxn; 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--;

            for (auto j: get_divisors(i)) {
                taken[j].push_back(i);
                not_taken[j].pop_front();
            }

            while (left) {
                auto e = get_best_edge(pq);
                e = max(e, get_multiple());
                ans += e.w;
                is[e.to] = is[e.from] = false;
                left--;
            }

            break;
        }

    cout << ans << endl;
}

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

    read();
    solve();
}