Second highest score

Problem

Print the second highest distinct score. Scores that equal the highest do not count as the second. The list always has at least two different scores.

Input: The first line has n, the number of values. The second line has the n values separated by spaces.
Output: One integer: the second highest distinct score.
Constraints: 2 ≤ n ≤ 1000
0 ≤ each score ≤ 1000
At least two scores are different.

Example

Input

6
12 35 1 10 34 1

Output

35 is the highest, 34 the second.

Try the problem first. Open one hint at a time.

Hint 1

Track two values while going through the list: the highest so far and the best score below it.

Hint 2

Ignore a score equal to the highest, so repeats do not become the second.

Write your Python code, run it on the examples and submit it to hidden tests.