#include <bits/stdc++.h>

using namespace std;

const int N = 200010;
int n;
int a[N], ans[N], dp[N][2], w[N];

void dfs(int v,int u){
    w[v] = 1;
    for (int o = v; o; o >>= 1){
        int ls = o << 1, rs = o << 1 | 1;
        dp[o][1] = w[o];
        dp[o][0] = 0;
        if (ls <= n){
            dp[o][1] += max(0, dp[ls][1]);
            dp[o][0] = max(dp[o][0], max(dp[ls][1],dp[ls][0]));
        }
        if (rs <= n){
            dp[o][1] += max(0, dp[rs][1]);
            dp[o][0] = max(dp[o][0], max(dp[rs][1],dp[rs][0]));
        }
    }
    int x = max(dp[1][0] , dp[1][1]);
    for (int i = x-1; i >= 0; --i){
        if (ans[i]) return;
        ans[i] = u;
    }
}
int main(){
    while(~scanf("%d",&n)){
        for (int i = 1; i <= n; ++i) {
            int x;
            scanf("%d",&x);
            a[x] = i;
            w[i] = -1;
            dp[i][0] = dp[i][1] = 0;
            ans[i-1] = 0;
        }
        for (int i = n; i >= 1; --i){
            dfs(a[i],i);
        }
        for (int i = 0; i < n; ++i){
            if (i) printf(" ");
            printf("%d",ans[i]);
        }
        puts("");
    }
    return 0;
}