import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline
from collections import defaultdict 
import itertools

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a
 
 
def isPrimeMR(n):
    d = n - 1
    d = d // (d & -d)
    L = [2]
    for a in L:
        t = d
        y = pow(a, t, n)
        if y == 1:
            continue
        while y != n - 1:
            y = (y * y) % n
            if y == 1 or t == n - 1:
                return 0
            t <<= 1
    return 1

def findFactorRho(n):
    m = 1 << n.bit_length() // 8
    for c in range(1, 99):
        f = lambda x: (x * x + c) % n
        y, r, q, g = 2, 1, 1, 1
        while g == 1:
            x = y
            for i in range(r):
                y = f(y)
            k = 0
            while k < r and g == 1:
                ys = y
                for i in range(min(m, r - k)):
                    y = f(y)
                    q = q * abs(x - y) % n
                g = gcd(q, n)
                k += m
            r <<= 1
        if g == n:
            g = 1
            while g == 1:
                ys = f(ys)
                g = gcd(abs(x - ys), n)
        if g < n:
            if isPrimeMR(g):
                return g
            elif isPrimeMR(n // g):
                return n // g
            return findFactorRho(g)
 
 
def primeFactor(n): #これを実行
    i = 2
    ret = {}
    rhoFlg = 0
    while i * i <= n:
        k = 0
        while n % i == 0:
            n //= i
            k += 1
        if k:
            ret[i] = k
        i += 1 + i % 2
        if i == 101 and n >= 2 ** 20:
            while n > 1:
                if isPrimeMR(n):
                    ret[n], n = 1, 1
                else:
                    rhoFlg = 1
                    j = findFactorRho(n)
                    k = 0
                    while n % j == 0:
                        n //= j
                        k += 1
                    ret[j] = k
 
    if n > 1:
        ret[n] = 1
    if rhoFlg:
        ret = {x: ret[x] for x in sorted(ret)}
    return ret


def main():
    N = int(input())
    A = list(map(int,input().split()))

    mx = max(A)
    num = [0]*(mx+1)

    dic = {}
    for a in A:
        if a not in dic: dic[a] = 1
        else: dic[a] += 1
    
    for a in dic:
        P = primeFactor(a)
        base = []
        L = []
        for p in P:
            base.append(p)
            temp = [i for i in range(P[p]+1)]
            L.append(temp)
        for T in itertools.product(*L):
            val = 1
            for i,t in enumerate(T):
                val *= pow(base[i],t)
            num[val] += dic[a]
    
    #print(num)

    ans = [1]*(N+1)
    for i in range(1,mx+1):
        del_num = N - num[i]
        ans[del_num] = i

    ret = [1]
    for v in ans:
        ret.append(max(ret[-1],v))
    print(*ret[1:N+1],sep="\n")


if __name__ == '__main__':
    main()