#include <bits/stdc++.h>
                            #include<iostream>
                            #include<cstdio>
                            #include<vector>
                            #include<queue>
                            #include<map>
                            #include<cstring>
                            #include<string>
                            #include <math.h>
                            #include<algorithm>
                        //    #include <boost/multiprecision/cpp_int.hpp>
                            #include<functional>
                     #define int long long
                            #define inf  1000000007
                            #define pa pair<int,int>
                            #define ll long long
                            #define pal pair<double,int>
                            #define ppa pair<pa,int>
                            #define ssa pair<string,int>
                            #define  mp make_pair
                            #define  pb push_back
                            #define EPS (1e-10)
                            #define equals(a,b) (fabs((a)-(b))<EPS)
                     
                            using namespace std;
                     //priority_queue<int, vector<int>, greater<int> > que;
                            class Point{
                            	public:
                            	double x,y;
                            	Point(double x=0,double y=0):x(x),y(y) {}
                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                            	Point operator * (double a) {return Point(x*a,y*a);}
                            	Point operator / (double a) {return Point(x/a,y/a);}
                            	double absv() {return sqrt(norm());}
                            	double norm() {return x*x+y*y;}
                            	bool operator < (const Point &p) const{
                            		return x != p.x ? x<p.x: y<p.y;
                            	}
                            	bool operator == (const Point &p) const{
                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                            	}
                            };
                            typedef Point Vector;
                     
                            struct Segment{
                            Point p1,p2;
                            };
                     
                        double hen(Vector a){
                        if(fabs(a.x)<EPS && a.y>0) return acos(0);
                        else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
                        else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
                        else if(fabs(a.y)<EPS && a.x>0) return 0.0;
                        else if(a.y>0) return acos(a.x/a.absv());
                        else return 2*acos(0)+acos(-a.x/a.absv());
                     
                        }
                     
                string itos( int i ) {
                ostringstream s ;
                s << i ;
                return s.str() ;
                }
                 
                int gcd(int v,int b){
                	if(v>b) return gcd(b,v);
                	if(v==b) return b;
                	if(b%v==0) return v;
                	return gcd(v,b%v);
                }
                            double dot(Vector a,Vector b){
                            	return a.x*b.x+a.y*b.y;
                            }
                            double cross(Vector a,Vector b){
                            	return a.x*b.y-a.y*b.x;
                            }
                        
                double distans(double x1,double y1,double x2,double y2){
                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                	return sqrt(rr);
                	
                }


                         //----------------kokomade tenpure------------
int N=262144;
pa sgt[530000];

pa minis(int i,int j ){
if(i==j) return sgt[i];
	else if(i%2==1){
		pa z=minis(i+1,j);
		if(sgt[i].first<z.first)return sgt[i] ;
		else return z;
	}
		else if(j%2==0) 	{
		pa z=minis(i,j-1);
		if(sgt[j].first<z.first)return sgt[j] ;
		else return z;
	}
else return minis(i/2,j/2);
}

pa sgtmin(int i ,int j) {
	return minis(i+N,j+N);
}

void upd(int x,int y){
	x+=N;
sgt[x].first=y;
	sgt[x].second=x;
x=x/2;
while(x != 0){
	if(sgt[2*x+1].first<sgt[2*x].first){
		sgt[x]=sgt[2*x+1];
	}
	else sgt[x]=sgt[2*x];

x=x/2;
}
}

int N2=262144;
pa sgt2[530000];

pa minis2(int i,int j ){
if(i==j) return sgt2[i];
	else if(i%2==1){
		pa z=minis2(i+1,j);
		if(sgt2[i].first<z.first)return sgt2[i] ;
		else return z;
	}
		else if(j%2==0) 	{
		pa z=minis2(i,j-1);
		if(sgt2[j].first<z.first)return sgt2[j] ;
		else return z;
	}
else return minis2(i/2,j/2);
}

pa sgtmin2(int i ,int j) {
	return minis2(i+N,j+N);
}

void upd2(int x,int y){
	x+=N;
sgt2[x].first=y;
	sgt2[x].second=x;
x=x/2;
while(x != 0){
	if(sgt2[2*x+1].first<sgt2[2*x].first){
		sgt2[x]=sgt2[2*x+1];
	}
	else sgt2[x]=sgt2[2*x];

x=x/2;
}
}


vector<int> G[200002];
int aite[200020];
int n;



void dfs(int i,int j,int p){
	if(i>=j) return;
	
	//if(i>10) return;
	pa z,zz;
	if(i%2==0){
		 z=sgtmin(i,j);
		 zz=sgtmin2(z.second,j);
		
	}
	else{
		 z=sgtmin2(i,j);
		 zz=sgtmin(z.second,j);
	}
	//cout<<i<<" "<<j<<" "<<z.first<<" "<<zz.first<<endl;
	G[p].pb(z.second);
	//cout<<p<<" "<<z.second<<endl;
	dfs(z.second+1,zz.second-1,z.second);
	aite[z.second]=zz.second;
	dfs(i,z.second-1,p);
	dfs(zz.second+1,j,p);
	
}

int atai[200020];
priority_queue<ppa,vector<ppa>,greater<ppa> > pq;

void ws(int i){
	for(int f=0;f<G[i].size();f++){
		pq.push(mp(mp(atai[G[i][f]],atai[aite[G[i][f]]]),G[i][f]));
	//	cout<<"p"<<atai[G[i][f]]<<" "<<atai[aite[G[i][f]]]<<endl;
	}
}


void yaru(int e){
//	cout<<"yaru"<<endl;
	while(1){
	//	cout<<"yaru"<<endl;
	if(pq.empty()) break;
	ppa z=pq.top();
	pq.pop();
		cout<<z.first.first<<" "<<z.first.second<<" ";
		for(int f=0;f<G[z.second].size();f++){
		pq.push(mp(mp(atai[G[z.second][f]],atai[aite[G[z.second][f]]]),G[z.second][f]));
		}
	}
	
}

signed main(){
	cin>>n;
	
	
	for(int i=N;i<2*N;i++) sgt[i]=make_pair(0,i-N);
	for(int i=N;i<2*N;i++) sgt2[i]=make_pair(0,i-N);
	for(int i=N+1;i<=N+n;i++){
		int u;
		cin>>u;
		if(i%2==0){
			sgt[i].first=u;
			sgt2[i].first=100*N+u;
		}
		else{
			sgt2[i].first=u;
			sgt[i].first=100*N+u;
		}	
		atai[i-N]=u;
	}
	
	for(int i=N-1;i>0;i--){
		if(sgt[2*i].first>sgt[2*i+1].first) sgt[i]=sgt[2*i+1];
		else sgt[i]=sgt[2*i];
	}
	for(int i=N-1;i>0;i--){
		if(sgt2[2*i].first>sgt2[2*i+1].first) sgt2[i]=sgt2[2*i+1];
		else sgt2[i]=sgt2[2*i];
	}
	dfs(1,n,0);
	
	
	ws(0);
	yaru(1);
	cout<<endl;
	return 0;
}

Measured memory_bytes: 36208