#include <bits/stdc++.h>
using namespace std;

long long gcd2(long long a,long long b) {
    if(a == 0 || b == 0) {
        return max(a,b);
    }
    if(a % b == 0) {
        return b;
    }
    else {
        return gcd2(b,a % b);
    }
}

struct UnionFind {
    vector<int> par;
    vector<int> size;
    UnionFind(int n) {
        par.resize(n);
        size.resize(n,1);
        for(int i = 0; i < n; i++) {
            par[i] = i;
        }
    }
    int find(int x) {
        if(par[x] == x) {
            return x;
        }
        return par[x] = find(par[x]);
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    int consize(int x) {
        return size[find(x)];
    }
    bool unite(int x, int y) {
        x = find(x);
        y = find(y);
        if(x == y) {
            return false;
        }
        if(size[x] > size[y]) {
            swap(x,y);
        }
        par[x] = y;
        size[y] += size[x];
        return true;
    }
};

int main() {
    int N;
    cin >> N;
    vector<int>A(N),B(100001);
    long long ans = 0;
    int cnt = 0;
    for(int i = 0; i < N; i++) {
        cin >> A[i];
        if(B[A[i]]) {
            ans += A[i];
            continue;
        }
        cnt++;
        B[A[i]] = 1;
    }
    UnionFind uf(100001);
    vector<pair<long long,pair<int,int>>>tmp;
    for(int i = 1; i <= 100000; i++) {
        int mi = -1;
        for(int j = 1; i*j <= 100000; j++) {
            if(B[i*j]) {
                mi = i*j;
                break;
            }
        }
        if(mi == -1) {
            continue;
        }
        for(int j = 1; i*j <= 100000; j++) {
            if(B[i*j]) {
                tmp.push_back({1ll*mi/gcd2(mi,i*j)*(i*j),{mi,i*j}});
            }
        }
    }
    sort(tmp.begin(),tmp.end());
    for(int i = 0; i < tmp.size(); i++) {
        if(uf.unite(tmp[i].second.first,tmp[i].second.second)) {
            ans += tmp[i].first;
        }
    }
    cout << ans << endl;
}