#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool umx(T& A, const T& B) {
  return A < B ? A = B, 1 : 0;
}
template <class T>
inline bool umn(T& A, const T& B) {
  return A > B ? A = B, 1 : 0;
}
const int INF = 0x3f3f3f3f;
const int maxn = 5000010;
int ls[maxn], rs[maxn], sum[maxn];
int tn;
inline int newnode(int s) {
  ++tn;
  sum[tn] = s;
  ls[tn] = 0;
  rs[tn] = 0;
  return tn;
}
int merge(int l, int r) {
  ++tn;
  sum[tn] = sum[l] + sum[r];
  ls[tn] = l;
  rs[tn] = r;
  return tn;
}
int build(int l, int r) {
  if (l == r) return newnode(0);
  int m = (l + r) >> 1;
  return merge(build(l, m), build(m + 1, r));
}
int add(int o, int l, int r, int x, int v) {
  if (l == r) return newnode(sum[o] + v);
  int m = (l + r) >> 1;
  return x <= m ? merge(add(ls[o], l, m, x, v), rs[o])
                : merge(ls[o], add(rs[o], m + 1, r, x, v));
}
int ub(int a, int b, int l, int r, int k) {
  if (l == r) return l;
  int m = (l + r) >> 1;
  int lsum = sum[ls[b]] - sum[ls[a]];
  return k < lsum ? ub(ls[a], ls[b], l, m, k)
                  : ub(rs[a], rs[b], m + 1, r, k - lsum);
}
int n;
int rt[maxn];
int a[maxn], nxt[maxn], pos[maxn];
int main() {
  scanf("%d", &n);
  tn = 0;
  rt[0] = build(1, n + 1);
  for (int i = (1), i_end_ = (n + 1); i < i_end_; ++i)
    scanf("%d", a + i), pos[a[i]] = n + 1;
  for (int i = (n + 1) - 1, i_end_ = (1); i >= i_end_; --i) {
    nxt[i] = pos[a[i]];
    pos[a[i]] = i;
    rt[i] = add(rt[i + 1], 1, n + 1, i, 1);
    if (nxt[i] <= n) rt[i] = add(rt[i], 1, n + 1, nxt[i], -1);
  }
  for (int k = (1), k_end_ = (n + 1); k < k_end_; ++k) {
    int t = 0;
    for (int i = (1), i_end_ = (n + 1); i < i_end_; ++i) {
      ++t;
      int j = ub(rt[0], rt[i], 1, n + 1, k) - 1;
      i = j;
    }
    printf("%d ", t);
  }
  putchar('\n');
  return 0;
}
