#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
const int M = 5000010;
int n, arr[N], pre[N], cur[N], l[M], r[M], seg[M], cnt = 0;
vector<int> add[N];
int Idx, L, R;
void build(int s, int e, int idx) {
  if (s == e) {
    seg[idx] = 0;
    return;
  }
  l[idx] = cnt++;
  r[idx] = cnt++;
  build(s, ((s + e) >> 1), l[idx]);
  build(((s + e) >> 1) + 1, e, r[idx]);
  seg[idx] = seg[l[idx]] + seg[r[idx]];
}
int update(int s, int e, int idx) {
  int Id = cnt++;
  if (s == e) {
    seg[Id] = 1;
    return Id;
  }
  l[Id] = l[idx], r[Id] = r[idx];
  if (Idx > ((s + e) >> 1))
    r[Id] = update(((s + e) >> 1) + 1, e, r[Id]);
  else
    l[Id] = update(s, ((s + e) >> 1), l[Id]);
  seg[Id] = seg[l[Id]] + seg[r[Id]];
  return Id;
}
int getsum(int s, int e, int idx) {
  if (s > R || e < L) return 0;
  if (s >= L && e <= R) return seg[idx];
  return getsum(s, ((s + e) >> 1), l[idx]) +
         getsum(((s + e) >> 1) + 1, e, r[idx]);
}
int get(int idx, int needed) {
  int s = 0, e = n - 1, sum = 0, mid, ans = 0;
  while (true) {
    if (s == e) {
      if (sum + seg[idx] <= needed) ans = s;
      break;
    }
    mid = ((s + e) >> 1);
    if (sum + seg[l[idx]] > needed) {
      e = mid;
      idx = l[idx];
    } else {
      sum += seg[l[idx]];
      ans = mid;
      s = mid + 1;
      idx = r[idx];
    }
  }
  return ans;
}
int main() {
  memset(pre, -1, sizeof(pre));
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &arr[i]);
    add[pre[arr[i]] + 1].push_back(i);
    pre[arr[i]] = i;
  }
  int last = cnt++;
  build(0, n - 1, last);
  for (int i = 0; i < n; i++) {
    cur[i] = last;
    for (int j = 0; j < (int)add[i].size(); j++) {
      Idx = add[i][j];
      cur[i] = last = update(0, n - 1, last);
    }
  }
  int ans = 0;
  for (int k = 1; k <= n; k++) {
    ans = 0;
    last = 0;
    while (true) {
      L = 0, R = last - 1;
      last = get(cur[last], (R >= L ? getsum(0, n - 1, cur[last]) : 0) + k);
      ans++;
      last++;
      if (last == n) break;
    }
    printf("%d ", ans);
  }
  puts("");
  return 0;
}
