#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n;
int a[maxn];
map<int, int> M[maxn];
int lef[maxn], rig[maxn];
int ans[maxn];
int calc(int k) {
  static int M[maxn], T = 1;
  T++;
  int j = 0;
  int ans = 0;
  for (int i = 1; i <= n; i = j + 1) {
    int sz = 0;
    while (j + 1 <= n) {
      if (M[a[j + 1]] != T) {
        if (sz + 1 <= k) {
          sz++;
          M[a[j + 1]] = T;
        } else {
          T++;
          break;
        }
      } else
        M[a[j + 1]] = T;
      j++;
    }
    ans++;
  }
  return ans;
}
void solve(int l, int r) {
  if (l == r) return;
  if (ans[l] == ans[r]) {
    for (int i = l; i <= r; i++) ans[i] = ans[l];
    return;
  }
  int mid = (l + r) >> 1;
  ans[mid] = calc(mid);
  ans[mid + 1] = calc(mid + 1);
  solve(l, mid);
  solve(mid + 1, r);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  ans[1] = calc(1);
  ans[n] = calc(n);
  solve(1, n);
  for (int i = 1; i <= n; i++) {
    printf("%d%c", ans[i], " \n"[i == n]);
  }
  return 0;
}
