#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
const int maxn = 1e5 + 5;
int n;
struct Tree {
  int lb, rb, val;
} tree[maxn << 6];
int pre[maxn], a[maxn], head[maxn];
int k, tot;
int update(int pos, int l, int r, int o, int cost) {
  int k = ++tot;
  tree[k] = tree[o];
  tree[k].val += cost;
  if (l == pos && r == pos) return k;
  int mid = (l + r) / 2;
  if (pos <= mid) tree[k].lb = update(pos, l, mid, tree[o].lb, cost);
  if (pos > mid) tree[k].rb = update(pos, mid + 1, r, tree[o].rb, cost);
  return k;
}
int query(int l, int r, int o, int cost) {
  if (l == r) return l;
  int mid = (l + r) / 2, lb = tree[o].lb, rb = tree[o].rb;
  if (tree[lb].val >= cost) return query(l, mid, lb, cost);
  return query(mid + 1, r, rb, cost - tree[lb].val);
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
    head[i] = update(i, 1, n, head[i - 1], 1);
    if (pre[a[i]]) head[i] = update(pre[a[i]], 1, n, head[i], -1);
    pre[a[i]] = i;
  }
  for (int i = 1; i <= n; i++) {
    int ans = 0, pos = n;
    while (true) {
      int need = tree[head[pos]].val - i;
      if (need <= 0) {
        ans++;
        break;
      }
      pos = query(1, n, head[pos], need);
      ans++;
    }
    printf("%d ", ans);
  }
  cout << endl;
  return 0;
}
