#include <bits/stdc++.h>
typedef const int &ci;
const int N = 100005;
const int B = 700;
inline int read() {
  int x = 0;
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  while (c >= '0' && c <= '9') x = 10 * x + c - '0', c = getchar();
  return x;
}
int n, a[N], ans[N];
bool vis[N];
inline int Solve(ci k) {
  if (ans[k]) return ans[k];
  int ret = 0;
  for (int i = 1, j = 1, tot; i <= n; i = j) {
    tot = 0;
    while (j <= n && (vis[a[j]] || tot + 1 <= k))
      tot += !vis[a[j]], vis[a[j]] = true, j++;
    ret++;
    for (int l = i; l <= j; l++) vis[a[l]] = false;
  }
  return ans[k] = ret;
}
inline int BS(int l, int r, int val) {
  while (l + 1 < r) {
    int mid = (l + r) >> 1;
    if (Solve(mid) == val)
      l = mid;
    else
      r = mid;
  }
  return l;
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int k = 1; k <= B && k <= n; k++) ans[k] = Solve(k);
  for (int l = B + 1, r, tmp; l <= n; l = r + 1) {
    r = BS(l, n + 1, tmp = Solve(l));
    for (int i = l; i <= r; i++) ans[i] = tmp;
  }
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  return 0;
}
