import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 18446744073709551615
# inf = 4294967295
md = 10**9+7
# md = 998244353

# def factors_all(n):
#     res = [[1] for _ in range(n+1)]
#     for f in range(2, n//2+1):
#         for i in range(f, n+1, f): res[i].append(f)
#     for f in range(n//2+1,n+1):
#         res[f].append(f)
#     return res

def factors(a):
    if a<=0:return [0]
    dd0,dd1=[],[]
    for d in range(1,round(a**0.5)+1):
        if a%d:continue
        dd0.append(d)
        dd1.append(a//d)
    if dd0[-1]==dd1[-1]:dd1.pop()
    return dd0+dd1[::-1]

mx = 1000001
# ff = factors_all(mx)
# sv = Sieve(mx)

# from random import randrange


n = II()
aa = LI()
# aa=[randrange(1,1000000) for _ in range(n)]

cnt = [0]*mx

for a in aa:
    for f in factors(a):
        cnt[f] += 1

ans = [0]*n
r = n
for f in range(mx-1, 0, -1):
    if r == 0: break
    if n-cnt[f] < r:
        for i in range(n-cnt[f], r):
            ans[i] = f
        r = n-cnt[f]

print(*ans, sep="\n")