k=int(input())
L=list(map(int,input().split()))
L.sort()
for i in range(k):
if len(L)==1:
break
elif i%2==0:
del L[len(L)-1]
else:
del L[0]
print(L[0])#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n;
int num[100001];
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> num[i];
}
sort(num, num + n);
int t = n % 2 == 0 ? n / 2 - 1 : n / 2;
cout << num[t];
}
230A - Dragons | 200B - Drinks |
13A - Numbers | 129A - Cookies |
1367B - Even Array | 136A - Presents |
1450A - Avoid Trygub | 327A - Flipping Game |
411A - Password Check | 1520C - Not Adjacent Matrix |
1538B - Friends and Candies | 580A - Kefa and First Steps |
1038B - Non-Coprime Partition | 43A - Football |
50A - Domino piling | 479A - Expression |
1480A - Yet Another String Game | 1216C - White Sheet |
1648A - Weird Sum | 427A - Police Recruits |
535A - Tavas and Nafas | 581A - Vasya the Hipster |
1537B - Bad Boy | 1406B - Maximum Product |
507B - Amr and Pins | 379A - New Year Candles |
1154A - Restoring Three Numbers | 750A - New Year and Hurry |
705A - Hulk | 492B - Vanya and Lanterns |