import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
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 = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

def f(k):
    st=set()
    cnt=1
    for a in aa:
        if len(st)==k and a not in st:
            cnt+=1
            st=set()
        st.add(a)
    return cnt

n=II()
aa=LI()
ans=[-1]*(n+2)
ans[0]=inf
lr=[(1,n+1)]
while lr:
    l,r=lr.pop()
    if ans[l-1]==ans[r]:
        ans[l:r]=[ans[r]]*(r-l)
    else:
        m=(l+r)//2
        ans[m]=f(m)
        if l<m:lr.append((l,m))
        if m+1<r:lr.append((m+1,r))

print(*ans[1:n+1],sep="\n")