#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, A;
    cin >> N;
    vector<ll> cnt(1e6+1), sm(1e6+1);
    for (int i=0; i<N; i++){
        cin >> A;
        cnt[A]++;
    }
    for (int i=1; i<=1e6; i++){
        for (int j=i; j<=1e6; j+=i) sm[i] += cnt[j];
    }
    vector<ll> ans(N+1);
    for (int i=1; i<=1e6; i++){
        ans[max(N-sm[i], 0LL)] = i;
    }

    for (int i=0; i<N; i++) ans[i+1] = max(ans[i+1], ans[i]);
    for (int i=0; i<N; i++) cout << ans[i] << endl;

    return 0;
}