#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N;
  cin >> N;
  const ll M = 1000000;
  vector<ll> B(M + 1);
  for (ll i = 0; i < N; i++)
  {
    ll a;
    cin >> a;
    B.at(a)++;
  }

  vector<ll> cnt(M + 1, 0);
  for (ll d = 1; d <= M; d++)
  {
    for (ll k = 1; k * d <= M; k++)
    {
      cnt.at(d) += B.at(k * d);
    }
  }

  vector<ll> ans(N + 1);
  ll tmp = 0;
  for (ll g = M; g >= 1; g--)
  {
    if (cnt.at(g) > tmp)
    {
      for (ll i = tmp + 1; i <= cnt.at(g); i++)
      {
        ans.at(i) = g;
      }
      tmp = cnt.at(g);
    }
  }
  
  for (ll i = N; i >= 1; i--)
  {
    cout << ans.at(i) << endl;
  }
}