#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	map<int, int>mp;
	rep(i, n) {
		int a; cin >> a;
		mp[a]++;
	}
	vector<int>c(1000001);
	for (auto p : mp) {
		int x = p.first;
		int y = p.second;
		for (int i = 1; i*i <= x; i++) {
			if (0 == x % i) {
				c[i] += p.second;
				if (x != i * i) c[x / i] += p.second;
			}
		}
	}
	vector<int>ans(n + 1, -1);
	rep(i, 1000001) ans[n - c[i]] = i;
	rep2(i, 1, n)chmax(ans[i], ans[i - 1]);
	rep(i, n) cout << ans[i] << endl;
	return 0;
}