//* #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //*/ #include using namespace std; //using namespace __gnu_cxx; //using namespace __gnu_pbds; //* #include using namespace atcoder; using mint=modint998244353; using Mint=modint1000000007; //*/ using uint=unsigned int; using ll=long long; using ull=unsigned long long; using P=pair; using Pl=pair; constexpr int mod=998244353; constexpr int Mod=1e9+7; constexpr int inf=Mod; constexpr ll linf=(ll)inf*inf; constexpr int dx[]={1,0,0,-1},dy[]={0,1,-1,0}; constexpr int Dx[]={1,1,1,0,0,-1,-1,-1},Dy[]={1,0,-1,1,-1,1,0,-1}; struct initio{ initio(){ cin.tie(0)->sync_with_stdio(0); cout< bool chmax(T&a,const T&b){ if(a bool chmin(T&a,const T&b){ if(a>b){ a=b; return 1; } return 0; } int fl2(ll n){ return 63-__builtin_clzll(n); } int main(){ int n,a; cin>>n; int mx=200000; vectorcnt(mx+1); while(cin>>a) cnt[a]++; ll ans=0; for(int i=1;i<=mx;i++) if(cnt[i]>=2) ans+=(cnt[i]-1ll)*i; vector>edges; for(int i=1;i<=mx;i++){ int mn=0; for(int j=i;j<=mx;j+=i){ if(cnt[j]==0) continue; if(mn==0) mn=j; else edges.push_back({lcm(mn,j),P(mn,j)}); } } sort(edges.begin(),edges.end()); dsu uf(mx+1); for(auto[c,p]:edges){ auto[u,v]=p; if(uf.same(u,v)) continue; uf.merge(u,v); ans+=c; } cout<