#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<tuple>
#include<set>
#include<map>
#include<random>
#include<chrono>
#include<array>
#include<unordered_map>
using namespace std;
const int MAX_N=4e5+2;
unordered_map<int,vector<int>>dp[MAX_N];
unordered_map<int,bool>calc[MAX_N];
int a[MAX_N];
int n;
vector<int> Merge(int u,vector<int>& Left,vector<int>& Right)
{
vector<int>res;
res.push_back(u);
int nums=1;
int idxL=0;
int idxR=0;
while(idxL<Left.size() or idxR<Right.size())
{
int cur=nums;
while(idxL<Left.size() && cur--)res.push_back(Left[idxL++]);
cur=nums;
while(idxR<Right.size() && cur--)res.push_back(Right[idxR++]);
nums*=2;
}
return res;
}
void rec(int u,int val)
{
if(u>n)return;
if(calc[u][val])return;
int l=n+1,r=n+1,al=n+1,ar=n+1;
if(2*u<=n){l=2*u;al=a[2*u];}
if(2*u+1<=n){r=2*u+1;ar=a[2*u+1];}
if(val<min(al,ar))
{
rec(l,al);
rec(r,ar);
dp[u][val]=Merge(val,dp[l][al],dp[r][ar]);
}
else if(al<min(val,ar))
{
rec(l,val);
rec(r,ar);
dp[u][val]=Merge(al,dp[l][val],dp[r][ar]);
}
else
{
rec(l,al);rec(l,val);
rec(r,al);rec(r,val);
dp[u][val]=min(Merge(ar,dp[l][al],dp[r][val]),
Merge(ar,dp[l][val],dp[r][al]));
}
calc[u][val]=1;
}
signed main ()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
rec(1,a[1]);
for(int x:dp[1][a[1]])cout<<x<<" ";
cout<<"\n";
return 0;
}
