#include <bits/stdc++.h>
using namespace std;
const int mxN=2e5, MGC1=5e5;
int n, a[mxN+1], cdi;
unordered_map<int, int> di[mxN+1];
vector<int> dp[MGC1], v1, v2;
void mrg(vector<int> &v, vector<int> &a, vector<int> &b) {
for(int l=1, i=0, j=0; i<a.size()||j<b.size(); i+=l, j+=l, l*=2) {
for(int k=0; k<l&&i+k<a.size(); ++k)
v.push_back(a[i+k]);
for(int k=0; k<l&&j+k<b.size(); ++k)
v.push_back(b[j+k]);
}
}
void as(int i, int b) {
if(di[i].find(b)==di[i].end())
di[i][b]=-1;
}
vector<int>& gd(int i, int b) {
return dp[di[i][b]];
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i=1; i<=n; ++i)
cin >> a[i];
as(1, a[1]);
for(int i=1; 2*i+1<=n; ++i) {
for(auto it=di[i].begin(); it!=di[i].end(); ++it) {
int b=it->first;
if(a[2*i+1]<b&&a[2*i+1]<a[2*i]) {
as(2*i, a[2*i]);
as(2*i+1, b);
as(2*i, b);
as(2*i+1, a[2*i]);
} else {
as(2*i, max(b, a[2*i]));
as(2*i+1, a[2*i+1]);
}
}
}
for(int i=n; i; --i) {
for(auto it=di[i].begin(); it!=di[i].end(); ++it) {
int b=it->first, c=it->second=cdi;
cdi=(cdi+1)%MGC1;
if(!cdi)
return 0;
dp[c].clear();
if(2*i+1<=n) {
if(a[2*i+1]<b&&a[2*i+1]<a[2*i]) {
v1={a[2*i+1]};
v2={a[2*i+1]};
mrg(v1, gd(2*i, a[2*i]), gd(2*i+1, b));
mrg(v2, gd(2*i, b), gd(2*i+1, a[2*i]));
dp[c]=min(v1, v2);
} else {
dp[c]={min(b, a[2*i])};
mrg(dp[c], gd(2*i, max(b, a[2*i])), gd(2*i+1, a[2*i+1]));
}
} else if(2*i<=n)
dp[c]={min(b, a[2*i]), max(b, a[2*i])};
else
dp[c]={b};
}
}
for(int b : gd(1, a[1]))
cout << b << " ";
}
