Two players play a game.

Initially there are nn integers a1,a2,…,ana1,a2,…,an 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−1n−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−1n−1turns if both players make optimal moves.

Input

The first line contains one integer nn (1≤n≤10001≤n≤1000) — the number of numbers on the board.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1061≤ai≤106).

Output

Print one number that will be left on the board.

Examples

Input

3
2 1 3

Output

2

Input

3
2 2 2

Output

2

Note

In the first sample, the first player erases 33 and the second erases 11. 22 is left on the board.

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

• A題：
• n個數字，兩個人輪流去數字，直到剩下最後一個數字為止，第一個人希望剩下的數字最小，第二個人希望數字最大，最終數字是多少？
• 思路：
• 貪心，第一個人每次取最大的，第二個人取最小的，最後就是中間值，直接排序即可。

• #include<iostream>
  #include<stdio.h>
  #include<string.h>
  #include<algorithm>
  #include<map>
  using namespace std;
  const int maxn=1e3+10;
  int main()
  {
      int n;
      int a[maxn];
      cin>>n;
      for(int i=1; i<=n; i++)
          cin>>a[i];
      sort(a+1,a+n+1);
      cout<<a[(n+1)/2]<<endl;
      return 0;
  }