#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
struct node {
  int val;
  int l, r;
  node *child[2];
  node(int l, int r) {
    this->l = l;
    this->r = r;
    child[0] = child[1] = nullptr;
    val = 0;
  }
  node(node *nut) {
    this->l = nut->l;
    this->r = nut->r;
    val = nut->val;
    child[0] = nut->child[0];
    child[1] = nut->child[1];
  }
};
node *root[N];
int a[N], last[N];
void build(node *nut) {
  if (nut->l == nut->r) return;
  int m = (nut->l + nut->r) >> 1;
  nut->child[0] = new node(nut->l, m);
  nut->child[1] = new node(m + 1, nut->r);
  build(nut->child[0]);
  build(nut->child[1]);
}
void update(node *nut, int id, int gt) {
  if (id > nut->r || id < nut->l) return;
  nut->val += gt;
  if (nut->l == nut->r) return;
  if (id <= nut->child[0]->r) {
    nut->child[0] = new node(nut->child[0]);
    update(nut->child[0], id, gt);
  } else {
    nut->child[1] = new node(nut->child[1]);
    update(nut->child[1], id, gt);
  }
}
int query(node *nut, int gt) {
  if (nut->val <= gt) return nut->r;
  if (nut->l == nut->r) return nut->l - 1;
  if (nut->child[0]->val > gt) return query(nut->child[0], gt);
  return query(nut->child[1], gt - nut->child[0]->val);
}
int main() {
  int n;
  scanf("%d", &n);
  root[n + 1] = new node(1, n);
  build(root[n + 1]);
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
  }
  for (int i = n; i >= 1; i--) {
    root[i] = new node(root[i + 1]);
    if (last[a[i]] > 0) {
      update(root[i], last[a[i]], -1);
    }
    last[a[i]] = i;
    update(root[i], i, 1);
  }
  for (int i = 1; i <= n; i++) {
    int u = 1;
    int ans = 0;
    while (u <= n) {
      ans++;
      u = query(root[u], i) + 1;
    }
    printf("%d ", ans);
  }
}
