#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll solve(ll N, vector<ll> &A, ll k){
    vector<ll> dp(N + 1, N + 3);
    vector<ll> cnts(N, 0);
    dp[0] = 0;

    ll left = 0;
    ll right = 0;
    ll kind = 0;
    while (left < N){
        if (right == N){
            cnts[A[left]]--;
            if (cnts[A[left]] == 0){
                kind--;
            }
            left++;
        }
        else if (kind <= k){
            if (cnts[A[right]] == 0){
                kind++;
            }
            cnts[A[right]]++;
            right++;
        }
        else{
            cnts[A[left]]--;
            if (cnts[A[left]] == 0){
                kind--;
            }
            left++;
        }
        if (kind <= k){
            dp[right] = min(dp[right], dp[left] + 1);
        }
    }
    return dp[N];
}

int main(){
    ll N;
    cin >> N;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++){
        cin >> A[i];
        A[i]--;
    }

    ll INF = 10000000000023;

    vector<ll> cnts(N, 0);

    ll B = 1500;
    for (ll i = 1; i <= min(B, N); i++){
        // 尺取り法 + dp
        cout << solve(N, A, i) << endl;
    }
    vector<ll> min_kind(N / B + 3);
    min_kind[0] = N + 1;
    for (ll i = 1; i <= N / B + 2; i++){
        // 答えが i になる種類数の最大値を求めよう
        ll ok = 0;
        ll ng = N + 1;
        while (ng - ok > 1){
            ll mid = (ok + ng) / 2;
            if (solve(N, A, mid) >= i){
                ok = mid;
            }
            else{
                ng = mid;
            }
        }
        min_kind[i] = ok;
    }
    // debug(min_kind);
    vector<ll> ans(N + 1);
    for (ll i = N / B + 1; i >= 1; i--){
        for (ll j = min_kind[i + 1] + 1; j <= min_kind[i]; j++){
            ans[j] = i;
        }
    }
    for (ll i = B + 1; i <= N; i++){
        cout << ans[i] << endl;
    }
}