CF984A.Game

Two players play a game.

Initially there are $n$ integers $a_1, a_2, \ldots, a_n$ written on the board. Each turn a player selects one number and erases it from the board. This continues until there is only one number left on the board, i. e. $n - 1$ turns are made. The first player makes the first move, then players alternate turns.

The first player wants to minimize the last number that would be left on the board, while the second player wants to maximize it.

You want to know what number will be left on the board after $n - 1$ turns if both players make optimal moves.

两名玩家进行一场游戏。

初始时，黑板上写有 $n$ 个整数 $a_1, a_2, \ldots, a_n$。每一轮，一名玩家选择一个数字并将其从黑板上擦除。如此继续，直至黑板上仅剩一个数字为止，即共进行 $n - 1$ 轮。先手玩家先行，之后双方轮流进行。

先手玩家的目标是使最终留在黑板上的数字尽可能小，而后手玩家的目标则是使其尽可能大。

若双方均采取最优策略，求经过 $n - 1$ 轮后黑板上剩余的数字是多少。

The first line contains one integer $n$ ($1 \le n \le 1000$) — the number of numbers on the board.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^6$).

第一行包含一个整数 $n$（$1 \le n \le 1000$）—— 表示黑板上数字的个数。

第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$1 \le a_i \le 10^6$）。

Print one number that will be left on the board.

输出最终留在黑板上的那个数字。

In the first sample, the first player erases $3$ and the second erases $1$. $2$ is left on the board.

In the second sample, $2$ is left on the board regardless of the actions of the players.

在第一个样例中，先手玩家擦除 $3$，后手玩家擦除 $1$，最终黑板上剩下 $2$。

在第二个样例中，无论双方玩家如何操作，黑板上最终都会剩下 $2$。