#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
//using mint = modint1000000007;
using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

vector<pair<long long, long long> > prime_factorize(long long N) {
    vector<pair<long long, long long> > res;
    for (long long a = 2; a * a <= N; ++a) {
        if (N % a != 0) continue;
        long long ex = 0; // 指数

        while (N % a == 0) {
            ++ex;
            N /= a;
        }

        res.push_back({a, ex});
    }

    if (N != 1) res.push_back({N, 1});
    return res;
}

int main(){
    ll n;
    cin >> n;
    VL a(n);
    rep(i,n) cin >> a[i];
    const ll mx = 1e5;
    dsu uf(n+mx);
    map<ll,ll> id;
    ll now = n;
    rep(i,n){
        VP ps = prime_factorize(a[i]);
        for(auto [c,d]:ps){
            if(id.count(c)){
                uf.merge(id[c],i);
            } else {
                id[c] = now++;
                uf.merge(id[c],i);
            }
        }
    }
    ll ans = INF;
    {
        set<ll> seen;
        bool flag = false;
        if(!id.count(2)){
            id[2] = now++;
            flag = true;
        }
        ll cnt = 0;
        rep(i,n){
            if(uf.same(id[2],i)) continue;
            if(seen.count(uf.leader(i))) continue;
            cnt++;
            seen.insert(uf.leader(i));
        }
        chmin(ans,cnt*2);
        if(flag) id.erase(2);
    }
    {
        set<ll> seen;
        ll mn = id.begin()->first;
        ll cnt = 0;
        rep(i,n){
            if(uf.same(id[mn],i)) continue;
            if(seen.count(uf.leader(i))) continue;
            cnt++;
            seen.insert(uf.leader(i));
        }
        chmin(ans,cnt*mn);
    }
    out(ans);
}