ICPC Provincial

The University of INC (UOI) is participating in an ICPC Provincial Contest, a qualifier contest for the ICPC Regional Contest. UOI has $3N$ students (numbered from $1$ to $3N$) who are eager to participate in the contest. There will be $N$ teams, each consisting of exactly $3$ students. Each student can only be assigned to only one team.

As the coach of UOI, you know that student $i$ has a skill rating of $A_i$. You define the strength of a team as the median of the skill ratings of its members.

In order to increase the chance for all UOI teams to qualify for the ICPC Regional Contest, you want to arrange the teams so that the strength of the weakest team is maximized. Determine the maximum strength of the weakest team.

The first line consists of an integer $N$ ($1 ≤ N ≤ 100\, 000$).

The second line consists of $3N$ integers $A_i$ ($0 ≤ A_i ≤ 4000$).

Output a single integer representing the maximum strength of the weakest team.