A. Truck Driver
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are a truck driver and have been given $$$n$$$ boxes. Your boss wants to know what the $$$k^{th}$$$ heaviest box weighs.

Input

The first line will contain the integer $$$k$$$ (($$$1 \leq k \leq 10^5$$$). The second line of input will contain $$$n$$$ integers ($$$1 \leq n \leq 10^5$$$) containing the weights of each of the $$$n$$$ boxes. Each box has a weight $$$w$$$ where ($$$1 \leq w \leq 10^5$$$) and all weights are distinct.

Output

Output the $$$k^{th}$$$ heaviest box's weight.

Examples
Input
4
1 5 3 2
Output
1
Input
1
1 2 3 4 5 6 7
Output
7