#include<cstdio>
#include<algorithm>
using namespace std;
int n,s[100005],a[100005],b[100005],cnta,cntb;
int main(){
	freopen("sort.in","r",stdin);
	freopen("sort.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&s[i]);
	}
	for(int i=1;i<=n;i++){
		if(i%2!=0){
			a[++cnta]=s[i];
		}
		else{
			b[++cntb]=s[i];
		}
	}
	sort(a+1,a+cnta+1);
	sort(b+1,b+cntb+1);
	for(int i=1;i<=n;i++){
		if(i%2!=0){
			printf("%d ",a[i/2+1]);
		}
		else{
			printf("%d ",b[i/2]);
		}
	}
	return 0;
}