#include<iostream>
#include<cmath>
#include<string>
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
int w[1002];
int main( ){
 int n;
 cin>>n;
 for(int i=1;i<=n;i++){
 	cin>>w[i];
 }
 sort(w+1,w+n+1);
 for(int i=1;i<=n/2+1;i++){
 	if(w[i]==w[n+1-i]){
 		cout<<w[i];
	 }
	 else{
	 	cout<<w[n+1-i]<<endl;
	 	cout<<w[i]<<endl;
	 }
 	
	 }
return 0;
}

50分的蒟蒻代码QAQ 帮忙救一下错 大佬们b