Optimal Point on a Line

You are given n points on a line with their coordinates x _i. Find the point x so the sum of distances to the given points is minimal.

Input

The first line contains integer n (1 ≤ n ≤ 3·10⁵) — the number of points on the line.

The second line contains n integers x _i ( - 10⁹ ≤ x _i ≤ 10⁹) — the coordinates of the given n points.

Output

Print the only integer x — the position of the optimal point on the line. If there are several optimal points print the position of the leftmost one. It is guaranteed that the answer is always the integer.Exampleinput

4
1 2 3 4

output

2

Solution:

#include <bits/stdc++.h>

using namespace std;

int a[1234567];

int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
    scanf("%d", a + i);
  }
  sort(a, a + n);
  printf("%d\n", a[(n - 1) / 2]);
  return 0;
}