#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];
void solve() {
    for (int i = 1; i <= n; i++) {
        cin >> w[i];
    }
    for (int i = n; i >= 1; i--) {
        sub[i].emplace_back(w[i]);
        for (int j : {2 * i, 2 * i + 1}) {
            if (j > n) continue;
            for (int p : sub[j]) {
                if (p == n + 1) continue;
                sub[i].emplace_back(p);
            }
        }
        sort(sub[i].begin(), sub[i].end());
        sub[i].emplace_back(n + 1);
        dp[i].resize(sub[i].size());
        int pt_l = 0;
        int pt_r = 0;
        const int INF = -1e9;
        int Q = 0;
//        cout << i << " HI " << endl;
        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];
            }
//            cout << " CHECK " << n << " " << i << endl;
            if (n >= 2 * i + 1) {
//                cout << pt_r << " " << sub[2 * i + 1].back() << " ??? " << " " << dp[2 * i + 1].size() << endl;
                while (sub[2 * i + 1][pt_r] < p) {
                    pt_r++;
                }
//                cout << pt_r << " HI " << endl;
                assert(pt_r < sub[2 * i + 1].size());
                S += dp[2 * i + 1][pt_r];
//                cout << " GG " << endl;
            }

//            cout << " CHECK3 " << n << " " << i << endl;
//            cout << S << " " << p << " ??? " << endl;
            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;
}