#include<stdio.h>
long int milk[10002];
void quicksort(int r,int t)
{   int i=r, j=t;
   long key;long temp; 
   if(r>=t)return;
   key=milk[r];
   while(1)
   {if(i<j)
	{while(milk[j]>=key&&i<j)
	j--;
	temp=milk[j];
       milk[j]=milk[i];
       milk[i]=temp;
	while(milk[i]<=key&&i<j)
	i++;
	temp=milk[i];
       milk[i]=milk[j];
       milk[j]=temp;}
	else break;}
	if(i==j)
	{quicksort(r,i-1);
	  quicksort(j+1,t);}}
	
	
	
void main()
{int N,i;
	printf("the amount of cows:\n");
	scanf("%d",&N);
     for(i=1;i<=N;i++)
	scanf("%ld",&milk[i]);
	quicksort(1,N);
	for(i=1;i<=N;i++)
	printf("%ld ",milk[i]);
	
	printf("%ld\n",milk[N/2-1]);
	}