#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 5;
int a[MAXN];
int vis[MAXN];
int ans[MAXN];
int n;
void Read() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
}
int GetAns(int k) {
  memset(vis, -1, sizeof(vis));
  int cnt = 0, ret = 1;
  for (int i = 1; i <= n; i++) {
    if (vis[a[i]] == ret) continue;
    cnt++;
    if (cnt > k) {
      ret++;
      cnt = 1;
    }
    vis[a[i]] = ret;
  }
  return ret;
}
void Solve(int l, int r) {
  if (l > r) return;
  int ansl = GetAns(l);
  int ansr = GetAns(r);
  if (ansl == ansr) {
    for (int i = l; i <= r; i++) {
      ans[i] = ansl;
    }
    return;
  }
  ans[l] = ansl;
  ans[r] = ansr;
  int mid = (l + r) >> 1;
  Solve(l + 1, mid);
  Solve(mid + 1, r - 1);
}
void Print() {
  for (int i = 1; i <= n; i++) {
    printf("%d ", ans[i]);
  }
}
int main() {
  Read();
  Solve(1, n);
  Print();
  return 0;
}
