The SCPC (Syrian Competitive Programming Contest) is getting closer. The Richard Fans decided to meet there, but they are in different houses far from each other, so choosing a house to meet in is not simple. You are given an array $$$P$$$ of length $$$N$$$ where $$$P_i$$$ denotes the position of the $$$i_{th}$$$ person's house.
They want to choose the best place such that they all walk as few as possible. Formally, they want a house that minimizes the total distance for all of them. They gave you their house positions to help them choose the best meeting point among these houses.
We denote the distance between two houses $$$i,j$$$ as $$$|P_i-P_j|$$$.
Here, $$$|X|$$$ denotes the absolute value of $$$X$$$, for example $$$|-10| = 10$$$, $$$|5| = 5$$$
You need to find and print the best house $$$P_i$$$ that minimizes the total distance for all fans.
The first line contains one integer $$$N$$$ ($$$1 \leq N \leq 2*10^5$$$) — the length of the array, $$$N$$$ is Odd.
The second line contains $$$N$$$ integers $$$P_1, P_2, \ldots, P_n$$$ ($$$1 \leq P_i \leq 10^9$$$) — the elements of the array.
Print one line containing the value $$$P_i$$$ that satisfies the minimum distance.
57 3 5 1 4
4
In the sample test, the total distance after choosing house at position $$$4$$$ is: $$$|7-4| + |3-4| + |5-4| + |1-4| + |4-4| = 8$$$
