#include<bits/stdc++.h>
using namespace std;

struct num{
	int m;
	bool f=0;
}a[1001]; 

bool cmp(num a,num b){
	return a.m>b.m;
}

int n;

int main(){
	cin>>n;
	for (int i=1;i<=n;++i){
		cin>>a[i].m;
	}
	cout<<endl;
	for (int i=1;i<=n;++i){
		int maxx=INT_MIN,minn=INT_MAX;
		for (int j=1;j<=n;++j){
			if (i%2!=0){
				if (a[j].f==0 && a[j].m>maxx){maxx=a[j].m;a[j].f=1;}
			}
			if (i%2==0){
				if (a[j].f==0 && a[j].m<minn){minn=a[j].m;a[j].f=1;}
			}
		}
		if (i%2==0)cout<<minn<<endl;
		if (i%2!=0)cout<<maxx<<endl;
	}
	
	return 0;
}

双层暴力写的，TLE不用管