from collections import *

def enum_div(M):
    L = [[1] for i in range(M + 1)]
    for i in range(2, M + 1):
        for j in range(i, M + 1, i):
            if j not in A:
                continue
            L[j].append(i)
    return L

N = int(input())
A = list(map(int, input().split()))
D = defaultdict(int)
for a in A:
    D[a] += 1
A = set(A)

M = 1010101
DD = enum_div(M)
L = [0] * M

for k, v in D.items():
    for j in DD[k]:
        L[j] += v
            
for i in range(M-2, -1, -1):
    L[i] = max(L[i], L[i + 1])
    
now = 1
for i in range(N):
    while L[now] + i >= N and L[now + 1] + i >= N:
        now += 1
    print(now)