#include<bits/stdc++.h>
using namespace std;
deque<int> z;
int main ()
{
	int n,m,x,y;
	cin>>n;
	int a[n];
	for(int i=1;i<=n;i++)
	{
		cin>>a[i],z.push_back(a[i]);
	}
	m=n/2+1;
	y=n/2+1;
	for(int k=1;k<=y;k++)
	{
	for(int j=1;j<=m;j++)
	{
		if(a[j]>a[j+1])
		swap(a[j],a[j+1]);
		x=z.size()/2+1;
		cout<<a[x];
		if(m>n)
		break;
	}m=m+2;
	}
	return 0;
}