#include <stdio.h>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <vector>
#define qaq inline
const int sz=1e6+19;
int n,arr[sz];
std::unordered_map<int,int> cnts;
std::vector<int> solve(){
    std::vector<int> divCnt(1e6+1,0),divisors;
    for(auto [ele,ct]:cnts){
        divisors.clear();
        for(int cx=1;cx*cx<=ele;++cx){
            if(ele%cx==0){
                divisors.push_back(cx);
                if(cx*cx!=ele)
                    divisors.push_back(ele/cx);
            }
        }
        for(auto cx:divisors)
            divCnt[cx]+=ct;
    }
    std::vector<int> ans(n,0);
    for(int cx=1;cx<=1e6;++cx){
        if(divCnt[cx]!=0)
            ans[n-divCnt[cx]]=std::max(ans[n-divCnt[cx]],cx);
    }
    for(int cx=1;cx<n;++cx)
        ans[cx]=std::max(ans[cx],ans[cx-1]);
    return ans;
}
int main(){
    scanf("%d",&n);
    for(int cx=0,u;cx<n;++cx){
        scanf("%d",&u);
        cnts[u]++;
    }
    auto ans=solve();
    for(auto cx:ans)
        printf("%d\n",cx);
    return 0;
}