#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)
#define all(x) begin(x), end(x)
template <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }
template <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }

class UnionFind {
public:
    UnionFind() = default;
    explicit UnionFind(int n) : data(n, -1) {}

    int find(int x) {
        if (data[x] < 0) return x;
        return data[x] = find(data[x]);
    }

    void unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return;
        if (data[x] > data[y]) std::swap(x, y);
        data[x] += data[y];
        data[y] = x;
    }

    bool same(int x, int y) {
        return find(x) == find(y);
    }

    int size(int x) {
        return -data[find(x)];
    }

private:
    std::vector<int> data;
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int N;
    cin >> N;
    const int M = 1e5;
    vector<ll> C(M+1);
    rep(i,0,N) {
        int x;
        cin >> x;
        ++C[x];
    }
    ll ans = 0;
    vector<tuple<ll, int, int>> es;
    rep(i,1,M+1) {
        if (C[i] > 1) {
            ans += i*(C[i]-1);
        }
        vector<int> vs;
        for (int j = i; j <= M; j += i) {
            if (C[j] > 0) {
                vs.push_back(j);
            }
        }
        rep(j,1,vs.size()) es.push_back({(ll)vs[0]*vs[j]/i, vs[0], vs[j]});
    }
    sort(all(es));
    UnionFind uf(M+1);
    for (auto [v, i, j] : es) {
        if (!uf.same(i, j)) ans += v;
        uf.unite(i, j);
    }
    cout << ans << endl;
}