#include<iostream>
#include<algorithm>
using namespace std;
int ch[10005], ch1[10005];
bool cmp(int a, int b)
{
return a > b;
}
int main()
{
int n;
while(scanf("%d", &n) != EOF)
{
int i, k = 0;
for(i = 0; i < n; i++)
scanf("%d", &ch[i]);
sort(ch, ch+n, cmp);
for(i = n-1; i >= 0; i--)
ch1[i] = ch[k++];
bool p = false;
for(i = 0; i < n/2; i++)
{
if(p == true)
printf(" ");
printf("%d %d", ch[i], ch1[i]);
p = true;
}
if(n % 2 != 0)
printf(" %d", ch[n/2]);
printf("\n");
}
return 0;
}