__import__("sys").setrecursionlimit(1000000)
N = int(input())
A = list(map(int, input().split()))

vis = [False for _ in range(N+1)]

def calc(k):
    global vis
    pre = 0
    res = 0
    distinct = k
    for i in range(N):
        if not vis[A[i]]:
            if distinct == k:
                res += 1
                for j in range(pre, i):
                    vis[A[j]] = False
                distinct = 1
                pre = i
            else:
                distinct += 1
            vis[A[i]] = True

    for i in range(pre, N):
        vis[A[i]] = False
    return res


ans = [0 for _ in range(N+1)]
def solve(l, r, mn, mx):
    if l >= r:
        return
    if mn == mx:
        for i in range(l, r):
            ans[i] = mn
        return
    m = (l + r) // 2
    fm = calc(m)
    ans[m] = fm
    solve(l, m, fm, mx)
    solve(m+1, r, mn, fm)

solve(1,N+1,1,N)
for i in range(1,N+1):
    print(ans[i])