#include <bits/stdc++.h>
using namespace std;
char IO;
int rd() {
  int s = 0, f = 0;
  while (IO = getchar(), IO < '0' || IO > '9')
    if (IO == '-') f = 1;
  do s = (s << 1) + (s << 3) + (IO ^ '0');
  while (IO = getchar(), IO >= '0' && IO <= '9');
  return f ? -s : s;
}
const int N = 101000, K = 50;
int n;
int a[N];
int T[N];
int ls[N * K], rs[N * K], s[N * K];
int cnt;
void Add(int p, int pre, int l, int r, int x, int y) {
  s[p] = s[pre] + y;
  if (l == r) return;
  int mid = (l + r) >> 1;
  if (x <= mid)
    rs[p] = rs[pre], Add(ls[p] = ++cnt, ls[pre], l, mid, x, y);
  else
    ls[p] = ls[pre], Add(rs[p] = ++cnt, rs[pre], mid + 1, r, x, y);
}
int Que(int p, int l, int r, int k) {
  if (l == r) return l;
  int mid = (l + r) >> 1;
  if (s[ls[p]] > k)
    return Que(ls[p], l, mid, k);
  else
    return Que(rs[p], mid + 1, r, k - s[ls[p]]);
}
int M[N];
int main() {
  n = rd();
  for (int i = 1, iend = n; i <= iend; ++i) a[i] = rd();
  int pre = 0;
  for (int i = n, iend = 1; i >= iend; --i) {
    T[i] = pre;
    if (M[a[i]]) {
      Add(T[i] = ++cnt, pre, 1, n + 1, M[a[i]], -1);
      pre = T[i];
    }
    M[a[i]] = i;
    Add(T[i] = ++cnt, pre, 1, n + 1, i, 1);
    pre = T[i];
  }
  for (int i = 1, iend = n; i <= iend; ++i) {
    int now = 1, ans = 0;
    while (now <= n) {
      int nxt = Que(T[now], 1, n + 1, i);
      now = nxt;
      ans++;
    }
    printf("%d", ans);
    putchar(i == n ? '\n' : ' ');
  }
}
