#include <bits/stdc++.h>
using namespace std;
struct seg {
  int bitsum;
  seg *lf, *rt;
} * tree[100010];
int n, ar[100010];
map<int, int> mp;
seg *newNode(seg *cur) {
  cur = new seg;
  cur->lf = cur->rt = NULL;
  cur->bitsum = 0;
  return cur;
}
seg *build(seg *cur, int l, int r) {
  cur = newNode(cur);
  if (l < r) {
    int mid = (l + r) / 2;
    cur->lf = build(cur->lf, l, mid);
    cur->rt = build(cur->rt, mid + 1, r);
    cur->bitsum = cur->lf->bitsum + cur->rt->bitsum;
  }
  return cur;
}
seg *update(seg *prev, seg *cur, int l, int r, int id, int v) {
  cur = newNode(cur);
  if (l == r) {
    cur->bitsum = v;
  }
  if (l < r) {
    int mid = (l + r) / 2;
    if (id <= mid) {
      cur->rt = newNode(cur->rt);
      cur->rt = prev->rt;
      cur->lf = update(prev->lf, cur->lf, l, mid, id, v);
    } else {
      cur->lf = newNode(cur->lf);
      cur->lf = prev->lf;
      cur->rt = update(prev->rt, cur->rt, mid + 1, r, id, v);
    }
    cur->bitsum = cur->lf->bitsum + cur->rt->bitsum;
  }
  return cur;
}
int query(seg *cur, int l, int r, int k) {
  if (cur->bitsum < k) {
    return r;
  }
  if (l == r) {
    return l;
  }
  if (l < r) {
    int mid = (l + r) / 2;
    if (k <= cur->lf->bitsum) {
      return query(cur->lf, l, mid, k);
    } else {
      return query(cur->rt, mid + 1, r, k - cur->lf->bitsum);
    }
  }
}
void input() {
  int i, j;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &ar[i]);
  }
}
void print(seg *cur) {
  if (cur == NULL) {
    return;
  }
  printf("%d", cur->bitsum);
  puts("");
  print(cur->lf);
  print(cur->rt);
}
void pre() {
  int i, j;
  mp.clear();
  tree[n] = build(tree[n], 0, n);
  seg *help;
  for (i = n - 1; i >= 0; i--) {
    tree[i] = update(tree[i + 1], tree[i], 0, n, i, 1);
    if (mp[ar[i]]) {
      help = tree[i];
      tree[i] = update(help, tree[i], 0, n, mp[ar[i]], 0);
    }
    mp[ar[i]] = i;
  }
}
void solve() {
  int i, j, k, l, cnt;
  for (k = 1; k <= n; k++) {
    l = 0;
    cnt = 0;
    while (l < n) {
      l = query(tree[l], 0, n, k + 1);
      cnt++;
    }
    if (k != 1) {
      printf(" ");
    }
    printf("%d", cnt);
  }
  puts("");
}
int main() {
  input();
  pre();
  solve();
}
