#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def IR(n):
    return [I() for _ in range(n)]
def LIR(n):
    return [LI() for _ in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    def f(n):
        i = 2
        res = {1,n}
        while i*i <= n:
            if n%i == 0:
                res.add(i)
                res.add(n//i)
            i += 1
        return res

    n = I()
    a = LI()
    m = max(a)+1
    cnt = [0]*m
    for x in a:
        for i in f(x):
            cnt[i] += 1
    ans = [0]*n
    for i in range(m)[::-1]:
        ci = cnt[i]-1
        if ci >= 0 and not ans[ci]:
            ans[ci] = i
    for i in range(n-1)[::-1]:
        ans[i] = max(ans[i],ans[i+1])
    for i in ans[::-1]:
        print(i)
    return


if __name__ == "__main__":
    solve()