#include <stdio.h>
int main(){
	int a[10005];
	int b[10005]={0};
	int n;
	scanf ("%d",&n);
	int c=(n+1)/2;
	for (int i=1;i<=n;i++){
		scanf ("%d",&a[i]);
	}
	for (int i=1;i<=n-1;i++){
		for (int j=1;j<=n-i;j++){
			if (a[j+1]<a[j]){
				int temp=a[j+1];
				a[j+1]=a[j];
				a[j]=temp;
			}
		}
	}
	int k=n-1;
	b[c]=a[n];
	for (int i=c-1,j=c+1;i>=1,j<=n;i--,j++){
		b[i]=a[k];
		k--;
		b[j]=a[k];
		k--;
	}
	for (int i=1;i<=n;i++){
		printf ("%d ",b[i]);
	}
	return 0;
}

#include <cstdio> #include <cstdlib> #include <algorithm> using namespace std; int d[10000],d2[100000]; int main() { int n; scanf("%d",&n); for (int i=0;i<n;i++) scanf("%d",&d[i]); sort(d,d+n); d2[n/2]=d[n-1]; int l=n/2-1; int r=n/2+1; bool flag=true; for (int i=n-2;i>=0;i--) { if (flag) d2[l--]=d[i]; else d2[r++]=d[i]; flag=!flag; } for (int i=0;i<n;i++) { if (i) printf(" "); printf("%d",d2[i]); } return 0; }