#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;}
template<class T1, class T2>istream& operator >> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template<class T1, class T2>ostream& operator << (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os;}
template<class T>istream& operator >> (istream& is, vector<T>& v) { for(T& x:v) is >> x; return is; }
template<class T>ostream& operator << (ostream& os, const vector<T>& v) {for(int i=0;i<v.size();i++) {os << v[i] << (i+1 == v.size() ? "":" ");} return os;}

//istream& operator >> (istream& is, modint1000000007& x) { unsigned int t; is >> t; x=t; return is; }
//istream& operator >> (istream& is, modint998244353& x) { unsigned int t; is >> t; x=t; return is; }
ostream& operator << (ostream& os, const modint1000000007& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint998244353& x) { os << x.val(); return os; }
template<class... A> void pt()      { std::cout << "\n"; }
template<class... A> void pt_rest() { std::cout << "\n"; }
template<class T, class... A> void pt_rest(const T& first, const A&... rest) { std::cout << " " << first; pt_rest(rest...); }
template<class T, class... A> void pt(const T& first, const A&... rest)      { std::cout << first; pt_rest(rest...); }

static const ll INF=1e18+7;
static const double PI=acos(-1);
static const double EPS=1e-10;

using v1d=vector<ll>;
using v2d=vector<v1d>;
using v3d=vector<v2d>;
using v4d=vector<v3d>;

using S=ll;
S op(S a,S b){
  return max(a,b);
}
S e(){
  return 0;
}

struct PrimeFact{
  v1d spf;
  PrimeFact(ll N){init(N);}
  void init(ll N){//前処理．spfを求める
    spf.assign(N+1,0);
    for (ll i=0;i<= N;i++)spf[i]=i;
    for (ll i=2;i*i<=N;i++){
      if (spf[i]!=i)continue;
      
      for (ll j=i+i;j<=N;j+=i){
        spf[j]=i;
      }
    }
  }
  vector<pll>get(ll n){//nの素因数分解を求める
    vector<pll>res;
    map<ll,ll> m;
    while (n!=1) {
      m[spf[n]]++;
      n/=spf[n];
    }
    for(auto [p,a]:m)res.push_back({p,a});
    return res;
  }
};


int main(void) {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  
  
  ll N;cin>>N;
  v1d a(N);cin>>a;
  ll MAX=1e6+7;
  vector<pll>cnt(MAX);
  for(ll i=0;i<MAX;i++)cnt[i]={0,i};
  
  PrimeFact pf(MAX);
  for(ll i=0;i<N;i++){
    auto prim=pf.get(a[i]);
    map<ll,ll>mem;
    function<void(vector<pll>)>dfs=[&](vector<pll> v){
      ll t=1;
      for(ll i=0;i<v.size();i++)t*=pow(v[i].first,v[i].second);
      if(mem.count(t))return;
      cnt[t].first++;
      for(ll i=0;i<v.size();i++){
        v[i].second--;
        if(v[i].second>=0)dfs(v);
        v[i].second++;
      }
      mem[t]=1;
    };
    
    dfs(prim);
    
  }
  sort(all(cnt));
  
  segtree<S,op,e>seg(MAX);
  for(ll i=0;i<MAX;i++)seg.set(i,cnt[i].second);
  
  for(ll k=0;k<N;k++){
    ll p=lower_bound(all(cnt),make_pair(N-k,-INF))-cnt.begin();
    pt(seg.prod(p,MAX));
  }
  
}