Educational Codeforces Round 16 B

Description

You are given n points on a line with their coordinates xi. 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·105) — the number of points on the line.

The second line contains n integers xi ( - 109 ≤ xi ≤ 109) — 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.

Example

input

41 2 3 4

output

2题意：找出一个点，以外的点距离它之和最小解法：排序找中间的数

#include<bits/stdc++.h>
using namespace std;
int a[3*100005];
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+1+n);
    if(n==1)
    {
        cout<<a[1]<<endl;
    }
    else if(n&1)
    {
    cout<<a[n/2+1]<<endl;
    }
    else
    {
        cout<<a[n/2]<<endl;
    }
    return 0;
}