求中位数

 Optimal Point on a Line

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  _

Appoint description:  System Crawler  (Sep 16, 2016 7:22:55 PM)

Description

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.

Sample Input

Input

4
1 2 3 4

Output

2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17

#include<cstdio>
#include<algorithm>
using namespace std;
int a[300001];
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
		sort(a+1,a+n+1);
		int t=(n+1)/2;
		printf("%d\n",a[t]);
	}
	return 0;
 }