#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
bool Mbe;
int n;
int a[200005];
vector<int> e[200005];
vector<int> dp[2005][2005];
//每次交换就是二叉树上换一条边.
//i 的子树一开始 a[i]=j. 最小的 bfs 序.
vector<int> combi(vector<int> a,vector<int> b){
	int now=1;
	vector<int> res;
	int pa=0,pb=0;
	while(1){
		if(pa>=(int)a.size()&&pb>=(int)b.size())break;
		if(pa+now-1<(int)a.size()&&pb+now-1<(int)b.size()){
			for(int i=pa;i<pa+now;i++)res.push_back(a[i]);
			for(int i=pb;i<pb+now;i++)res.push_back(b[i]);
			pa+=now,pb+=now;now*=2;continue;
		}
		if(pa+now-1<(int)a.size()){
			for(int i=pa;i<pa+now;i++)res.push_back(a[i]);
			for(int i=pb;i<(int)b.size();i++)res.push_back(b[i]);
			pb=(int)b.size();pa+=now;now*=2;continue;
		}	
		if(pb+now-1<(int)b.size()){
			for(int i=pa;i<(int)a.size();i++)res.push_back(a[i]);
			for(int i=pb;i<pb+now;i++)res.push_back(b[i]);
			pa=(int)a.size();pb+=now;now*=2;continue;
		}		
		for(int i=pa;i<(int)a.size();i++)res.push_back(a[i]);
		for(int i=pb;i<(int)b.size();i++)res.push_back(b[i]);
		break;
	}
	return res;
}
bool Med;
signed main(){
	//cerr<<(&Mbe-&Med)/1048576.00<<"\n";
	n=read();
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=2;i<=n;i++)e[i/2].push_back(i);
	for(int i=1;i<=n;i++)sort(e[i].begin(),e[i].end());
	for(int i=n;i>=1;i--){
		for(int j=1;j<=n;j++)dp[i][j].push_back(j);
		if(e[i].empty())continue;
		if((int)e[i].size()==1){
			int s=e[i][0];
			for(int j=1;j<=n;j++){
				//现在 a[i]=j.
				dp[i][j].clear();
				if(j>a[s]){
					dp[i][j].push_back(a[s]);
					for(auto v:dp[s][j])dp[i][j].push_back(v);
				}
				else{
					dp[i][j].push_back(j);
					for(auto v:dp[s][a[s]])dp[i][j].push_back(v);
				}
			}
		}
		else{
			int ls=e[i][0],rs=e[i][1];
			for(int j=1;j<=n;j++){
				dp[i][j].clear();
				if(j<=a[ls]&&j<=a[rs]){
					dp[i][j].push_back(j);
					vector<int> tmp=combi(dp[ls][a[ls]],dp[rs][a[rs]]);
					for(auto it:tmp)dp[i][j].push_back(it);
				}
				else if(a[ls]<=j&&a[ls]<=a[rs]){
					dp[i][j].push_back(a[ls]);
					vector<int> tmp=combi(dp[ls][j],dp[rs][a[rs]]);
					for(auto it:tmp)dp[i][j].push_back(it);
				}
				else{
					dp[i][j].push_back(a[rs]);
					vector<int> ta=combi(dp[ls][a[ls]],dp[rs][j]);
					vector<int> tb=combi(dp[ls][j],dp[rs][a[ls]]);
					if(ta>tb)swap(ta,tb);
					for(auto v:ta)dp[i][j].push_back(v);
				}
			}
		}
	}
	for(auto v:dp[1][a[1]])cout<<v<<" ";
	cout<<"\n";
	return 0;
}
//look at my code
//my code is amazing