ESRC Training C/C++

Given a sequence of n integers a₁, a₂,... a_n. Find the second-highest item of a_i (i = 1...n).

Input

Line 1: contains the integer n (1 ≤ n ≤ 10⁶).

Line 2 to n + 1: (i + 1)-th line contains the integer a_i (|a_i| ≤ 10⁹)

Output

Only one line contains the second-highest item of ai.

Example

Input:
3
1
2
3

Output:
2