#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 7;
inline int read() {
  int x = 0, f = 1;
  char C = getchar();
  while (!isdigit(C)) {
    if (C == '-') f = -1;
    C = getchar();
  }
  while (isdigit(C)) x = (x << 1) + (x << 3) + C - '0', C = getchar();
  return x * f;
}
int n, a[maxn], last[maxn];
int root[maxn], ls[maxn << 5], rs[maxn << 5], T[maxn << 5], tot;
inline void add(int &u, int pre, int l, int r, int x, int k) {
  u = ++tot;
  ls[u] = ls[pre], rs[u] = rs[pre];
  if (l == r) {
    T[u] = k;
    return;
  }
  int mid = (l + r) >> 1;
  (mid >= x) ? add(ls[u], ls[pre], l, mid, x, k)
             : add(rs[u], rs[pre], mid + 1, r, x, k);
  T[u] = T[ls[u]] + T[rs[u]];
}
inline int Query(int u, int l, int r, int k) {
  if (l == r && k == 1)
    return l;
  else if (l == r)
    return -1;
  int mid = (l + r) >> 1;
  if (k > T[rs[u]])
    return Query(ls[u], l, mid, k - T[rs[u]]);
  else
    return Query(rs[u], mid + 1, r, k);
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) {
    a[i] = read();
    if (last[a[i]])
      add(root[i], root[i - 1], 1, n, last[a[i]], 0);
    else
      root[i] = root[i - 1];
    last[a[i]] = i;
    add(root[i], root[i], 1, n, i, 1);
  }
  for (int i = 1; i <= n; i++) {
    int ans = 0, now = n;
    while (now != -1) {
      ans++;
      if (T[root[now]] <= i) break;
      now = Query(root[now], 1, n, i + 1);
    }
    printf("%d ", ans);
  }
  return 0;
}
