#include <iostream>

#include <cstdio>

#define REP(i,a,n) for(int i=a;i<=n;++i)

#define PER(i,a,n) for(int i=n;i>=a;--i)

#define hr putchar(10)

#define lc tr[o].l

#define rc tr[o].r

#define mid ((l+r)>>1)

#define ls lc,l,mid

#define rs rc,mid+1,r

using namespace std;

const int N = 1e5+10;

int n, tot, a[N], nxt[N], T[N];

struct {int l,r,v;} tr[N<<6];

void add(int &o, int l, int r, int ql, int qr) {

	tr[++tot] = tr[o], o = tot;

	if (ql<=l&&r<=qr) return ++tr[o].v,void();

	int tag = tr[o].v-min(tr[lc].v,tr[rc].v);

	if (mid>=ql) add(ls,ql,qr);

	if (mid<qr) add(rs,ql,qr);

	tr[o].v = tag+min(tr[lc].v,tr[rc].v);

}

int find(int o, int l, int r, int x, int k) {

	if (l==r) return l;

	k -= tr[o].v-min(tr[lc].v,tr[rc].v);

	if (mid<x) return find(rs,x,k);

	return tr[rc].v>k?find(ls,x,k):find(rs,x,k);

}

int solve(int k) {

	int ans = 0, now = 1;

	while (now<=n) {

		now = find(T[now],1,n,now,k)+1;

		++ans;

	}

	return ans;

}

int main() {

	scanf("%d", &n);

	REP(i,1,n) scanf("%d", a+i);

	PER(i,1,n) {

		T[i] = T[i+1];

		add(T[i],1,n,i,nxt[a[i]]?nxt[a[i]]-1:n);

		nxt[a[i]] = i;

	}

	REP(i,1,n) printf("%d ", solve(i));hr;

}