#include<stdio.h>
void quickSort(int *A,int start,int end);
void quickSort(int *A,int start,int end)
{
int i = start;
int j = end;
int temp = A[i];
if(i<j)
{
while(i < j)
{
while(i<j && temp<A[j])
j--;
if(i<j)
A[i++] = A[j];
while(i<j && temp>A[i])
i++;
if(i<j)
A[j--] = A[i];
}
A[i] = temp;
quickSort(A,start,i-1);
quickSort(A,i+1,end);
}
}
int main(void)
{
int i;
int cowCount;
int milk[10000];
scanf("%d",&cowCount);
for(i=0; i<cowCount; i++)
scanf("%d",&milk[i]);
quickSort(milk,0,cowCount-1);
printf("%d",milk[(cowCount)/2]);
}
void quickSort(int *A,int start,int end);
void quickSort(int *A,int start,int end)
{
int i = start;
int j = end;
int temp = A[i];
if(i<j)
{
while(i < j)
{
while(i<j && temp<A[j])
j--;
if(i<j)
A[i++] = A[j];
while(i<j && temp>A[i])
i++;
if(i<j)
A[j--] = A[i];
}
A[i] = temp;
quickSort(A,start,i-1);
quickSort(A,i+1,end);
}
}
int main(void)
{
int i;
int cowCount;
int milk[10000];
scanf("%d",&cowCount);
for(i=0; i<cowCount; i++)
scanf("%d",&milk[i]);
quickSort(milk,0,cowCount-1);
printf("%d",milk[(cowCount)/2]);
}