#include<cstdio>
#include<algorithm>
#define N 500005 
using namespace std;
int n,m,e[N],o[N];bool t[N<<1],sum;
void swap(int &x,int &y){int t=x;x=y;y=t;}
void ud(int x){while(x<=n)t[x]=!t[x],x+=x&-x;}
bool gs(int x){bool sum=0;while(x)sum^=t[x],x&=x-1;return sum;}
void print()
{
	for(int i=1;i<=m;i++)printf("%d %d ",e[i],o[i]);
	if(n&1)printf("%d",e[m+1]);
}
int main(){
	freopen("sort.in","r",stdin);freopen("sort.out","w",stdout);
	scanf("%d",&n);m=n>>1;
	for(int i=1;i<=m;i++)scanf("%d%d",e+i,o+i);
	if(n&1)scanf("%d",e+m+1);
	if(n<4){print();return 0;}
	if(n&1)m++;
	for(int i=m;i;i--)sum^=gs(e[i]),ud(e[i]);
	for(int i=1;i<=n;i++)t[i]=0;
	sort(e+1,e+m+1);
	if(n&1)m--;
	for(int i=m;i;i--)sum^=gs(o[i]),ud(o[i]);
	sort(o+1,o+m+1);
	if(sum)if(n&1)swap(e[m],e[m+1]);else swap(o[m-1],o[m]);
	print();
	return 0; 
}