#include<iostream>
#include<cstring>
#include<vector>
#include<array>
#include<tuple>
#include<algorithm>
using namespace std;
using LL = long long;
const int maxn = 1e5 + 5, INF = 0x3f3f3f3f;

namespace SGT1{

int tr[maxn * 4];

void modify(int u, int l, int r, int x, int v){
    if (l == r){
        tr[u] = v;
        return;
    }
    int mid = (l + r) / 2;
    if (x <= mid) modify(2 * u, l, mid, x, v);
    else modify(2 * u + 1, mid + 1, r, x, v);
    tr[u] = min(tr[2 * u], tr[2 * u + 1]);
}

int query(int u, int l, int r, int L, int R){
    if (l > R or r < L) return INF;
    if (l >= L and r <= R) return tr[u];
    int mid = (l + r) / 2;
    return min(query(2 * u, l, mid, L, R), query(2 * u + 1, mid + 1, r, L, R));
}

}

namespace SGT2{

int tr[maxn * 4];

void modify(int u, int l, int r, int x, int v){
    if (l == r){
        tr[u] += v;
        return;
    }
    int mid = (l + r) / 2;
    if (x <= mid) modify(2 * u, l, mid, x, v);
    else modify(2 * u + 1, mid + 1, r, x, v);
    tr[u] = min(tr[2 * u], tr[2 * u + 1]);
}

int find_first(int u, int l, int r){
    if (l == r) return r;
    int mid = (l + r) / 2;
    if (tr[2 * u] == 0) return find_first(2 * u, l, mid);
    return find_first(2 * u + 1, mid + 1, r);
}

}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    vector<int> a(n + 1), last(n + 2);
    vector<vector<int> > pos(n + 1);
    for(int i = 0; i <= n; i++){
        pos[i].push_back(0);
    }
    vector<vector<pair<int, int> > > seg(n + 2);
    memset(SGT1::tr, 0x3f, sizeof SGT1::tr);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        int mn = (a[i] == 0 ? i : SGT1::query(1, 0, n, 0, a[i] - 1));
        if (mn <= i){
            if (mn > last[a[i] + 1]){
                seg[a[i] + 1].push_back({mn, i});
                // cout << mn << ' ' << i << ' ' << a[i] + 1 << '\n';
            }
            for(int j = a[i] + 1; j <= n; j++){
                int cur = last[j];
                if (cur == -1) continue;
                int nxt = last[j + 1];
                if (min(mn, cur) > nxt){
                    int l = min(mn, last[j]);
                    seg[j + 1].push_back({l, i});
                    // cout << l << ' ' << i << ' ' << j + 1 << '\n';
                }
            }
        }
        last[a[i]] = i;
        pos[a[i]].push_back(i);
        SGT1::modify(1, 0, n, a[i], i);
    }
    for(int i = 0; i <= n; i++){
        pos[i].push_back(n + 1);
    }
    vector<vector<pair<int, int> > > q(n + 1);
    {
        for(int i = 0; i + 1 < pos[0].size(); i++){
            int len = pos[0][i + 1] - pos[0][i] - 1;
            q[1].push_back({0, 1});
            if (len + 1 <= n) q[len + 1].push_back({0, -1});
        }
    }
    for(int i = 1; i <= n; i++){
        if (seg[i].empty()) continue;
        vector<pair<int, int> > p;
        for(auto [l, r] : seg[i]){
            int pre = *prev(lower_bound(pos[i].begin(), pos[i].end(), l));
            int nxt = *upper_bound(pos[i].begin(), pos[i].end(), r);
            int len = nxt - pre - 1;
            q[r - l + 1].push_back({i, 1});
            if (len + 1 <= n) q[len + 1].push_back({i, -1});
        }
    }
    for(int i = 1; i <= n; i++){
        for(auto [x, v] : q[i]){
            SGT2::modify(1, 0, n, x, v);
        }
        cout << SGT2::find_first(1, 0, n) << ' ';
    }

}