#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int main() {
    int N;
    cin >> N;
    vector<int> A(N), D(1000001, 0), ans(N, 1);
    rep(i, 0, N) cin >> A[i];
    rep(i, 0, N) {
        for (int j = 1; j * j <= A[i]; j++) {
            if (A[i] % j == 0) {
                D[j]++;
                if (j * j != A[i]) D[A[i] / j]++;
            }
        }
    }
    rep(i, 1, 1000001) {
        if (D[i] == 0) continue;
        ans[N - D[i]] = i;
    }
    rep(i, 0, N) {
        if (i > 0) ans[i] = max(ans[i], ans[i - 1]);
        cout << ans[i] << endl;        
    }
}