#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;
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;
}

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

        if (!mins[x / i])
            mins[x / i] = 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;
    } 
}

long long get_edge(int x) {
    long long ans = inf;
    auto d = get_divisors(x);
    for (auto i: d)
        if (mins[i] < x)
            ans = min(ans, (long long)x * mins[i] / i);

    return ans != inf ? ans : 0;
}

void solve() {
    for (int i = 1; i < maxn; i++)
        if (is[i])
            add_num(i);

    for (int i = maxn-1; i >= 1; i--)
        if (is[i])
            ans += get_edge(i);

    cout << ans << endl;
}

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

    read();
    solve();
}