#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}
using p = pair<int, int>;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vi cnt(1000011, 0);
    rep(i, n){
        int a; cin >> a;
        cnt[a]++; 
    }
    vi c(1000011, 0);
    rep2(i, 1, 1000011){
        for(int j = i; j <= 1000011; j += i)c[i] += cnt[j];
    }
    auto comp = [](p a, p b) -> bool{
        if(a.second != b.second){
            return a.second < b.second;
        }else{
            return a.first < b.first;
        }
    };

    priority_queue<p, vector<p>, decltype(comp)> pq(comp);
    rep2(i, 1, 1000011){
        if(c[i] == 0)continue;
        pq.push({i, c[i]});
    }
    int ans = 0;
    rep(i, n){
        int k = n-i;
        while(!pq.empty() && pq.top().second >= k){
            int b = pq.top().first; pq.pop();
            ans = max(b, ans);
        }
        cout << ans << endl;
    }

    return 0;
}