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

class UnionFind{
    private:
    vector<int> par,siz;
    public:
    UnionFind(int N){
        par.resize(N,-1);
        siz.resize(N,1);
    }
 
    int root(int x){ //連結成分の代表頂点を返す.
        if(par.at(x) == -1) return x;
        else return par.at(x) = root(par.at(x));
    }
    bool unite(int u, int v){ //u,vを連結する 連結してた->false,した->trueを返す.
        u = root(u),v = root(v);
        if(u == v) return false;
 
        if(siz.at(u) < siz.at(v)) swap(u,v); //Union by size.
        par.at(v) = u;
        siz.at(u) += siz.at(v);
        return true;
    }
    bool issame(int u, int v){ //同じ連結成分ならtrue.
        if(root(u) == root(v)) return true;
        else return false;
    }
    int size(int pos){return siz.at(root(pos));} //posの連結成分の大きさを返す.
};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n = 1000000;
    vector<bool> prime(n+1);
    vector<int> allp,lpf(n+1,1);
    for(int i=2; i<=n; i++){
        if(lpf.at(i) == 1) lpf.at(i) = i,allp.push_back(i),prime.at(i) = true;
        for(auto &p : allp){
            if(p*i > n || p > lpf.at(i)) break;
            lpf.at(p*i) = p;
        }
    }
    vector<vector<pair<int,int>>> Pf(n+1);
    for(int i=2; i<=n; i++){
        int n = i;
        while(n > 1){
            int p = lpf.at(n),e = 0;
            while(n%p == 0) n /= p,e++;
            Pf.at(i).emplace_back(pair{p,e});
        }
    }

    int N; cin >> N;
    vector<int> A(N);
    for(auto &a : A) cin >> a;
    UnionFind Z(N+n);

    vector<tuple<int,int,int>> edge;
    for(int i=0; i<N; i++) for(auto [p,e] : Pf.at(A.at(i))) edge.push_back({p*e,i,N+p});
    sort(edge.rbegin(),edge.rend());
    long long answer = 0;
    for(auto &[cost,u,v] : edge){
        if(Z.issame(u,v)) answer += cost;
        else Z.unite(u,v);
    }
    cout << answer << endl;

}