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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    constexpr int r = 1'000'000;
    vector<bool> tb(r + 1);
    vector<int> p, cnt(r + 1), dp(r + 1, 1 << 30);
    for(int i = 2; i <= r; i++){
        if(tb[i]) continue;
        p.emplace_back(i);
        dp[i] = 0;
        for(int j = 2 * i; j <= r; j += i) tb[j] = true;
    }
    for(int j = 0; p[j] <= 1000; j++){
        int v = p[j] * p[j];
        while(v <= r){
            dp[v] = 0;
            tb[v] = false;
            v *= p[j];
        }
    }
    for(int i = 2; i <= r; i++){
        for(int j = 0; p[j] * i <= r; j++){
            dp[p[j] * i] = min(dp[p[j] * i], dp[i] + p[j]);
        }
    }
    int v;
    for(int i = 0; i < n; i++){
        cin >> v;
        cnt[v]++;
    }
    ll ans = 0;
    for(int j = 2; j <= r; j++){
        if(!tb[j]) continue;
        int sv = 0, mx = 0;
        ll tot = 0;
        for(int i = j; i <= r; i += j){
            tot += dp[i] * (ll)(cnt[i]);
            if(cnt[i] >= 1)mx = max(mx, dp[i]);
            sv += cnt[i];
        }
        if(sv >= 2){
            bool fst = true;
            ans += tot - mx;
            for(int i = j; i <= r; i += j){
                if(dp[i] == mx){
                    cnt[i] = fst;
                    fst = false;
                }else{
                    cnt[i] = 0;
                }
            }
        }
    }
    cout << ans << '\n';
}