#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n;
int a[N];
int last[N];
int t[N * 4];
vector<int> in[N];
vector<int> ord[N];
int ans[N];
int get(int v, int tl, int tr, int l, int r) {
  if (tl > r || tr < l) return 0;
  if (tl >= l && tr <= r) return t[v];
  int mid = tl + tr >> 1;
  return get(v + v, tl, mid, l, r) + get(v + v + 1, mid + 1, tr, l, r);
}
void upd(int v, int tl, int tr, int pos, int add) {
  if (tl == tr)
    t[v] += add;
  else {
    int tm = (tl + tr) / 2;
    if (pos <= tm)
      upd(v + v, tl, tm, pos, add);
    else
      upd(v + v + 1, tm + 1, tr, pos, add);
    t[v] = t[v + v] + t[v + v + 1];
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    ord[1].push_back(i);
  }
  for (int i = 1; i <= n; i++) {
    int from = 1;
    from = last[a[i]] + 1;
    last[a[i]] = i;
    in[from].push_back(i);
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < in[i].size(); j++) {
      int x = in[i][j];
      upd(1, 1, n, x, 1);
    }
    for (int j = 0; j < ord[i].size(); j++) {
      int x = ord[i][j];
      ans[x]++;
      int pos = -1;
      int l = 0, r = n + 1;
      while (r - l > 1) {
        int mid = l + r >> 1;
        if (get(1, 1, n, 1, mid) < x + 1)
          l = mid;
        else
          r = mid;
      }
      pos = r;
      ord[pos].push_back(x);
    }
    upd(1, 1, n, i, -1);
  }
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << ' ';
  }
  return 0;
}
