#include #include using namespace std; using ll = long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; #define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep2(i, a, b) rep3(i, a, b, 1) #define rep1(i, n) rep2(i, 0, n) #define rep0(n) rep1(aaaaa, n) #define ov4(a, b, c, d, name, ...) name #define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__) #define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--) #define fore(e, v) for (auto&& e : v) #define all(a) begin(a), end(a) #define sz(a) (int)(size(a)) #define lb(v, x) (lower_bound(all(v), x) - begin(v)) #define eb emplace_back template bool chmin(T& a, const S& b) { return a > b ? a = b, 1 : 0; } template bool chmax(T& a, const S& b) { return a < b ? a = b, 1 : 0; } const int INF = 1e9 + 100; const ll INFL = 3e18 + 100; #define i128 __int128_t struct _ { _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); } } __; int main(){ int N; cin>>N; vi A(N); fore(i,A)cin>>i; const int MAX_A=1'000'000+9; vi d(MAX_A); iota(all(d),0); rep(i,2,MAX_A){ if(d[i]!=i)continue; rep(j,i*2,MAX_A,i)chmin(d[j],i); } vi pidx(MAX_A); int pcnt=0; { rep(i,2,MAX_A){ if(d[i]==i)pidx[i]=pcnt++; } } atcoder::dsu uf(N+pcnt); using al3 = array; vector E; rep(i,N){ while(A[i]>1){ ll p=d[A[i]],c=0; while(d[A[i]]==p){ A[i]/=p; c++; } E.push_back(al3{-p*c,pcnt+i,pidx[p]}); } } ll ans=0; sort(all(E)); fore(e,E){ if(uf.same(e[1], e[2])){ ans-=e[0]; }else{ uf.merge(e[1], e[2]); } } cout<