#line 1 "main.cpp"
#include <bits/stdc++.h>
#include <atcoder/all>
// #include "library/templates/template.cpp"
using namespace atcoder;
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

vector<int64_t> divisor(int64_t n)
{
    vector<int64_t> ret;
    for (int64_t i = 1; i * i <= n; i++)
    {
        if (n % i == 0)
        {
            ret.push_back(i);
            if (i * i != n)
                ret.push_back(n / i);
        }
    }
    sort(begin(ret), end(ret));
    return (ret);
}

template <typename T>
void chmax(T &a, T b) { a = max(a, b); }

vector<ll> solve(int N, const std::vector<long long> &A)
{
    vector<ll> cnt(1e6 + 1, 0);
    for (ll a : A)
    {
        auto d = divisor(a);
        for (ll x : d)
        {
            cnt[x]++;
        }
    }
    vector<ll> res(N, 0);
    for (ll i = 1; i <= 1e6; i++)
    {
        if (cnt[i])
        {
            chmax(res[N - cnt[i]], i);
        }
    }
    for (int i = 1; i < N; i++)
    {
        chmax(res[i], res[i - 1]);
    }

    return res;
}

int main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int N;
    std::cin >> N;
    std::vector<long long> A(N);
    for (int i = 0; i < N; ++i)
    {
        std::cin >> A[i];
    }
    auto ans = solve(N, A);
    for (int i = 0; i < N; ++i)
    {
        std::cout << ans[i] << '\n';
    }
    return 0;
}