#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
// #define long long long long
int main() {
    const long long MX = 100000;
    vector<vector<long long>> L(MX + 1);
    for (long long i = 1; i <= MX; ++i) {
        long long x = i;
        while (x < MX) {
            L[x].push_back(i);
            x += i;
        }
    }

    long long N;
    cin >> N;
    vector<long long> A(N);
    for (long long i = 0; i < N; ++i) cin >> A[i];

    unordered_map<long long, vector<pair<long long, long long>>> D;
    vector<tuple<long long, long long, long long>> Mvec;

    for (long long i = 0; i < N; ++i) {
        for (long long p : L[A[i]]) {
            D[p].emplace_back(A[i], i);
        }
    }

    for (auto &[key, vec] : D) {
    	if(vec.size() > 1){
	        sort(vec.begin(), vec.end());
	        for (long long i = 1; i < vec.size(); ++i) {
	            long long cost = 1LL * vec[0].first * vec[i].first / key;
	            Mvec.emplace_back(cost, vec[0].second, vec[i].second);
	        }
    	}

    }

    sort(Mvec.begin(), Mvec.end());
    dsu DS(N);

    long long ans = 0;
    for (auto &[cost, i, j] : Mvec) {
        if (!DS.same(i, j)) {
            DS.merge(i, j);
            ans += cost;
        }
    }

    cout << ans << '\n';
    return 0;
}