#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define P pair #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) UB(A,x)-LB(A,x) templateusing min_priority_queue=priority_queue,greater>; using mint=modint1000000007; //using mint=modint998244353; void chmax(ll&a,ll b){a=max(a,b);} void chmin(ll&a,ll b){a=min(a,b);} ll op(ll a,ll b){return __gcd(a,b);} ll e(){return 0;} signed main(){ ll N;cin>>N; vectorM(1000001),A(N); REP(i,N)cin>>A[i]; sort(ALL(A)); REP(i,N)FOR(d,1,1001)if(A[i]%d==0&&d*d<=A[i]){ M[d]++;if(d*dans(N); REP(i,1000001)if(M[i])ans[M[i]-1]=i; reverse(ALL(ans));REP(i,N-1)chmax(ans[i+1],ans[i]); REP(i,N)cout<