#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<int>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	int N;
	cin >> N;
	vi v(N), w(1000001);
	vin(v);

	int a=0, b=0, c=0, x, y, z;
	map<int, int> m;
	rep(i, N) {
		m[v[i]]++;
	}
	for (auto p : m) {
		vi t;
		int n = p.first;
		for (int i = 1; i*i <= n; i++) {
			if (n % i == 0) {
				t.push_back(i);
				if (i*i != n) t.push_back(n/i);
			}
		}
		rep(j, t.size()) w[t[j]] += p.second;
	}
	vi ans;
	rep(i, 1000001) {
		while (w[1000001-i] > a) {
			ans.pb(1000001-i);
			a++;
		}
	}
	rep(i, N) {
		std::cout << ans[N-1-i] << '\n';
	}
}