Second largest mark

Problem

A teacher wants the second highest distinct mark in a class. Equal marks count once, so in 9 9 4 the second highest is 4. If there is no second distinct mark, print NONE.

Input, output and limits

Input: Line 1: the integer n. Line 2: n integers, the marks.
Output: The second largest distinct mark, or the word NONE.
Constraints: 1 ≤ n ≤ 10^5
-10^9 ≤ mark ≤ 10^9

Examples

Example

Input

5
72 95 88 95 60

Output

Distinct marks: 95, 88, 72, 60. The second largest is 88.

Hints

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

Hint 1

Remove repeated marks first. A set does that.

Hint 2

After sorting the distinct marks, check how many there are before you read the second last.

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

Solve in the editor

Orders above the averageeasy
Repeated customer ideasy
Days without a weekly holidayeasy
Ticket code reads the same both wayseasy
Two orders that match a budgetmedium

All Python problems

Problem

Input, output and limits

Examples

Hints

More How to Approach a Problem problems

Problem

Input, output and limits

Examples

Hints

More How to Approach a Problem problems