#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;

#define pb push_back

typedef long long ll;
typedef long double ld;
int n;
const int maxN = 2e5 + 10;
int w[maxN];
vector<int> dp[maxN];
vector<int> sub[maxN];
int ans[maxN];
int TRASH[maxN];
int SZ = 0;
void solve() {
    for (int i = 1; i <= n; i++) {
        cin >> w[i];
    }
    for (int i = 0; i <= n; i++) ans[i] = 0;
    for (int i = n; i >= 1; i--) {
        sub[i].emplace_back(w[i]);
        SZ = 0;
        if (2 * i > n) {
            SZ = 1;
            TRASH[0] = n + 1;
        }
        else if (2 * i + 1 > n) {
            SZ = sub[2 * i].size();
            for (int j = 0; j < SZ; j++) TRASH[j] = sub[2 * i][j];
        }
        else {
            merge(sub[2 * i].begin(), sub[2 * i].end() - 1, sub[2 * i + 1].begin(), sub[2 * i + 1].end(), TRASH);
            SZ = sub[2 * i].size() + sub[2 * i + 1].size() - 1;
        }
        assert(TRASH[SZ - 1] == n + 1);
        sub[i].resize(SZ + 1);
        int fi_g = -1;
        for (int j = 0; j < SZ; j++) {
            if (TRASH[j] >= w[i]) {
                fi_g = j;
                break;
            }
        }
        assert(fi_g != -1);
        for (int p = 0; p < fi_g; p++) {
            sub[i][p] = TRASH[p];
        }
        sub[i][fi_g] = w[i];
        for (int p = fi_g; p < SZ; p++) {
            sub[i][p + 1] = TRASH[p];
        }
        dp[i].resize(sub[i].size());
        int pt_l = 0;
        int pt_r = 0;
        const int INF = -1e9;
        int Q = 0;
        for (int p : sub[i]) {
            int S = -INF;
            if (w[i] >= p) S = 1;
            else S = -1;

            if (n >= 2 * i) {
                while (sub[2 * i][pt_l] < p) pt_l++;
                assert(pt_l < sub[2 * i].size());
                S += dp[2 * i][pt_l];
            }
            if (n >= 2 * i + 1) {
                while (sub[2 * i + 1][pt_r] < p) {
                    pt_r++;
                }
                assert(pt_r < sub[2 * i + 1].size());
                S += dp[2 * i + 1][pt_r];
            }
            if (S >= 1) {
                ans[S - 1] = max(ans[S - 1], p);
            }
            S = max(S, 0);
            dp[i][Q] = S;
            Q++;
        }
    }
    for (int i = n - 2; i >= 0; i--) ans[i] = max(ans[i], ans[i + 1]);
    ans[0] = n;
    for (int i = 0; i < n; i++) cout << ans[i] << " ";
    cout << '\n';

}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    while (cin >> n) {
        solve();
    }
    return 0;
}