#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vvvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pl; typedef pair ppl; typedef pair pppl; typedef pair pppppl; #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second #define bs(A,x) binary_search(all(A),x) #define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin()) #define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin()) #define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x)) templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint a){os<>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ templateostream&operator<<(ostream&os,pairp){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} int main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); ll N;cin>>N; vl A(N);cin>>A; ll ans=0; sort(all(A)); { vl _A; rep(i,0,N){ if(i&&A[i-1]==A[i])ans+=A[i]; else _A.emplace_back(A[i]); } A=_A; N=sz(A); } vectorD(200001,pl(1e18,1e18)); rep(i,0,N)for(ll d=1;d*d<=A[i];d++)if(A[i]%d==0)chmin(D[d],pl(A[i],i)),chmin(D[A[i]/d],pl(A[i],i)); vectores; rep(i,0,N)for(ll d=1;d*d<=A[i];d++)if(A[i]%d==0){ ll j=D[d].S,k=D[A[i]/d].S; if(i!=j)es.emplace_back(A[i]*A[j]/d,pl(i,j)); if(i!=k)es.emplace_back(A[i]*A[k]/(A[i]/d),pl(i,k)); } sort(all(es)); dsu G(N); for(auto[w,p]:es){ auto[u,v]=p; if(!G.same(u,v))G.merge(u,v),ans+=w; } assert(G.size(0)==N); cout<