#include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <vector>
#include <map>
#include <numeric>
#include <set>
#include <cmath>
#include <deque>
#include <queue>
#include <random>
#include <ranges>
#include <string>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include<functional>
#include<cstring>
#include<utility>
#include<complex>
#include <cassert>
using namespace std;

using int64 = long long;

constexpr int64 infll = (1LL << 62) - 1;
constexpr int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in: v) is >> in;
  return is;
}

template<typename T1, typename T2>
bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template<typename T1, typename T2>
bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template<typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template<typename T, typename V>
enable_if_t<is_class_v<T> == 0> fill_v(T &t, const V &v) {
  t = v;
}

template<typename T, typename V>
enable_if_t<is_class_v<T> != 0> fill_v(T &t, const V &v) {
  for (auto &e: t) fill_v(e, v);
}

template<typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(std::forward<F>(f)) {
  }

  template<typename... Args>
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template<typename F>
decltype(auto) MFP(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}

int main() {
  int N;
  cin >> N;
  vector< int > A(N);
  for (auto& a : A) {
    cin >> a;
    --a;
  }
  auto solve = [&](int k) {
    vector last(N, -1);
    int t = 0, d = 0, ret = 1;
    for (const auto& a : A) {
      if (last[a] != t) {
        last[a] = t;
        ++d;
      }
      if (d > k) {
        d = 0;
        ++t;
        ++ret;
        last[a] = t;
      }
    }
    return ret;
  };
  vector< int > ans(N + 1);
  auto unos = MFP([&](auto unos, int l, int r) -> void {
    if (l >= r) {
      return;
    }
    if (l + 1 == r) {
      ans[l] = solve(l);
      return;
    }
    ans[l] = solve(l);
    ans[r - 1] = solve(r - 1);
    if (ans[l] == ans[r - 1]) {
      for (int k = l; k < r; k++) {
        ans[k] = ans[l];
      }
    } else {
      unos(l + 1, (l + r) / 2);
      unos((l + r) / 2, r - 1);
    }
  });
  unos(1, N + 1);
  ans.erase(ans.begin());
  for (const auto& a : ans) cout << a << endl;
}