/* -*- coding: utf-8 -*-
 *
 * 1730.cc:  No.1730 GCD on Blackboard in yukicoder - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_A = 1000000;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

int as[MAX_N], cs[MAX_A + 1], gs[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  int maxa = 0;
  for (int i = 0; i < n; i++) {
    int ai;
    scanf("%d", &ai);

    for (int p = 1; p * p <= ai; p++)
      if (ai % p == 0) {
	cs[p]++;
	int q = ai / p;
	if (q != p) cs[q]++;
      }

    maxa = max(maxa, ai);
  }

  for (int a = maxa; a > 0; a--)
    if (cs[a] > 0 && gs[n - cs[a]] == 0) gs[n - cs[a]] = a;

  for (int i = 0, pg = 0; i < n; i++) {
    if (gs[i] < pg) gs[i] = pg;
    printf("%d\n", gs[i]);
    pg = gs[i];
  }
  return 0;
}