#include <bits/stdc++.h>
using namespace std;
const int N = 100001;
int n, a[100005], L[100005], c[100005], is[100005];
int mnv[400005], tag[400005], vl[400005], vr[400005], posl[400005];
vector<int> pos[100005], add[100005];
void U(int x, int y) {
    is[x] += y;
    if (y == 1 && is[x] != 1) return;
    if (y == -1 && is[x] != 0) return;
    // cout << "Uing:" << x << ' ' << y << '\n';
    while (x <= N) c[x] += y, x += x & -x;
}
int Q() {
    int r = 0;
    for (int i = 16; i >= 0; i--) {
        if (r + (1 << i) <= N && c[r + (1 << i)] == (1 << i)) {
            r += (1 << i);
        }
    }
    // cout << "R:" << r << '\n';
    return r;
}
void Build(int p, int l, int r) {
    mnv[p] = 1, tag[p] = -1, vl[p] = l, vr[p] = r, posl[p] = l;
    if (l == r) return;
    int mid = (l + r) / 2;
    Build(p * 2, l, mid), Build(p * 2 + 1, mid + 1, r);
}
void Pushup(int p) {
    vl[p] = vl[p * 2];
    vr[p] = vr[p * 2 + 1];
    mnv[p] = min(mnv[p * 2], mnv[p * 2 + 1]);
}
void Tag(int p, int z) { tag[p] = z, vl[p] = vr[p] = z, mnv[p] = posl[p] - z + 1; }
void Pushdown(int p) {
    if (tag[p] != -1) Tag(p * 2, tag[p]), Tag(p * 2 + 1, tag[p]), tag[p] = -1;
}
void Set(int p, int l, int r, int x, int y, int z) {
    if (x <= l && r <= y) return Tag(p, z);
    int mid = (l + r) >> 1;
    Pushdown(p);
    if (x <= mid) Set(p * 2, l, mid, x, y, z);
    if (mid < y) Set(p * 2 + 1, mid + 1, r, x, y, z);
    Pushup(p);
}
int Getmn(int p, int l, int r, int x, int y) {
    if (x <= l && r <= y) return mnv[p];
    int mid = (l + r) >> 1, res = 1e9;
    Pushdown(p);
    if (x <= mid) res = min(res, Getmn(p * 2, l, mid, x, y));
    if (mid < y) res = min(res, Getmn(p * 2 + 1, mid + 1, r, x, y));
    return res;
}
int GetL(int p, int l, int r, int x) {
    if (l == r) return vl[p];
    int mid = (l + r) >> 1;
    Pushdown(p);
    if (x <= mid) return GetL(p * 2, l, mid, x);
    return GetL(p * 2 + 1, mid + 1, r, x);
}
int GetL_ge(int x) {
    int l = 1, r = n, ans = n + 1;
    while (l <= r) {
        int mid = (l + r) >> 1;
        if (GetL(1, 1, n, mid) >= x) ans = mid, r = mid - 1;
        else l = mid + 1;
    }
    return ans;
}
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]), a[i]++, pos[a[i]].push_back(i);
    }
    Build(1, 1, n);
    for (int i = 1; i <= N; i++) {
        pos[i].push_back(0), pos[i].push_back(n + 1);
        sort(pos[i].begin(), pos[i].end());
        for (int j = 0; j + 1 < pos[i].size(); j++) {
            int l = pos[i][j] + 1, r = pos[i][j + 1] - 1;
            if (l > r) continue;
            if (r - l + 1 < i - 1) continue;
            int p = GetL_ge(l);
            if (p > r) continue;
            int mn = Getmn(1, 1, n, p, r);
            /*for (int k = l; k <= r; k++) {
                if (L[k] >= l) {
                    mn = min(mn, k - L[k] + 1);
                }
            }*/
            int mx = r - l + 1;
            // cout << i << ' ' << l << ' ' << r << '\n';
            if (mn <= mx) {
                add[mn].push_back(i);
                add[mx + 1].push_back(-i);
                // cout << "Adding:" << mn << ' ' << mx << ' ' << i << '\n';
            }
            Set(1, 1, n, p, r, pos[i][j]);
            // for (int k = l; k <= r; k++) L[k] = min(L[k], pos[i][j]);
        }
    }
    for (int i = 1; i <= n; i++) {
        for (auto j : add[i]) {
            if (j > 0) U(j, 1);
            else U(-j, -1);
        }
        cout << Q() << ' ';
    }
}