#include <bits/stdc++.h>
using namespace std;
using pll = pair<long long, long long>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long gcd_helper(long long a, long long b) {
  if (a % b == 0)
    return b;
  else
    return gcd_helper(b, a % b);
}
long long gcd(long long a, long long b) {
  if (a < 0) a *= -1;
  if (b < 0) b *= -1;
  if (a < b) swap(a, b);
  if (b == 0) return a;
  return gcd_helper(a, b);
}
long long powr(long long a, long long b, long long M) {
  if (b == 0) return 1;
  if (a == 0) return 0;
  long long ret = 1;
  while (b) {
    if (b & 1) {
      ret *= a;
      ret %= M;
    }
    a = (a * a) % M;
    b /= 2;
  }
  return ret;
}
long long find(long long x, vector<long long> &p) {
  if (p[x] != x) p[x] = find(p[x], p);
  return p[x];
}
void unite(long long x, long long y, vector<long long> &p,
           vector<long long> &sz) {
  long long px = find(x, p);
  long long py = find(y, p);
  if (sz[px] < sz[py]) {
    swap(px, py);
    swap(x, y);
  }
  p[py] = px;
  sz[px] += sz[py];
}
const int N = 1e5 + 5;
int n, k, dis, blockid, block;
int a[N], ans[N], f[N], l[350], r[350], ctr[350];
int fctr[350][N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (long long i = 0; i < (n); i++) cin >> a[i];
  blockid = 0;
  k = 1;
  while (k * k <= n) {
    ++blockid;
    block = dis = 0;
    for (long long i = 0; i < (n); i++) {
      if (f[a[i]] == blockid) continue;
      if (dis + 1 > k) {
        dis = 1;
        block++;
        f[a[i]] = ++blockid;
      } else {
        dis++;
        f[a[i]] = blockid;
      }
    }
    block++;
    ans[k] = block;
    k++;
  }
  for (long long i = 0; i < (350); i++) r[i] = -1;
  while (k <= n) {
    for (long long i = 1; r[i - 1] + 1 < n; i++) {
      while (l[i] <= r[i - 1]) {
        fctr[i][a[l[i]]]--;
        if (fctr[i][a[l[i]]] == 0) {
          ctr[i]--;
        }
        l[i]++;
      }
      while (r[i] + 1 < n) {
        r[i]++;
        if (fctr[i][a[r[i]]] == 0) {
          if (ctr[i] + 1 > k) {
            r[i]--;
            break;
          }
          ctr[i]++;
        }
        fctr[i][a[r[i]]]++;
      }
      ans[k] = i;
    }
    k++;
  }
  for (long long i = 0; i < (n); i++) cout << ans[i + 1] << " ";
  cout << endl;
  return 0;
}
