#include <bits/stdc++.h>
using namespace std;
int a[100005], ans[100005], appear[100005], ti[100005], n, t;
int cnt(int k) {
  int ret = 1;
  int count = 0;
  t++;
  for (int i = 1; i <= n; i++) {
    if (ti[a[i]] != t) {
      appear[a[i]] = false;
      ti[a[i]] = t;
    }
    if (!appear[a[i]]) {
      if (count == k) {
        count = 0;
        ret++;
        ti[a[i]] = ++t;
      }
      count++;
    }
    appear[a[i]] = true;
  }
  return ret;
}
void solve(int l, int r, int lo, int hi) {
  if (l > r) return;
  int mid = (l + r) / 2;
  int res = lo == hi ? lo : cnt(mid);
  ans[mid] = res;
  solve(l, mid - 1, res, hi);
  solve(mid + 1, r, lo, res);
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  solve(1, n, 1, n);
  for (int i = 1; i <= n; i++) {
    if (i > 1) printf(" ");
    printf("%d", ans[i]);
  }
  printf("\n");
}
