An online auction house records every bid placed on a lot, in the order submitted -- the same bidder, or the same amount, may appear more than once. After the auction closes, the house wants the second-highest DISTINCT bid amount actually placed: the highest bid amount that is strictly less than the top bid amount. If every bid tied at the same value, if there was only one bid, or if there were no bids at all, there is no such runner-up amount.

Input format

• Line 1: an integer n, the number of bids placed (n may be 0).
• Line 2: n space-separated integers, the bid amounts in the order they were placed (this line may be empty or absent when n is 0).

Output format

Print the second-highest distinct bid amount. If it does not exist, print NONE.

Constraints

• 0 <= n <= 10^5
• each bid amount satisfies 0 <= amount <= 10^9

3
100 200 300

200

1
100

NONE