This question is a continuation of the problem Algorithm Performance.

The company would now like to look at some of the slightly slower hardware to analyse what performance improvements are possible compared to the fastest. They would like you to find the 4th fastest run time they have achieved.

Input

The first line contains an integer, ~n~ ~(n \geq 5)~. The following line then contains ~n~ space seprated unique integers ~x_i~ ~(1 \leq x_i \leq 10^5)~. These represent the run times of the algorithm.

Output

Print the 4th fastest of all the run times.

Examples

Input

5  
3 5 8 7 20

Output

8

Input

9
6 10 4 69 2 41 68 10000 3

Output

6