Second Highest Student

You are given a list of student records. Each record contains a student's name and an integer score. Your task is to find the student with the second highest unique score.

If there is no second highest score, output No second highest score. In the case where more than one student has the second highest score, output the name of the student who appears first in the input order.

The mathematical idea is: let \( S \) be the set of all scores. If \(|S| < 2\), then there is no second highest score. Otherwise, let \( sorted(S) \) be the scores in descending order and the second element is the second highest score.

inputFormat

The first line contains an integer n, the number of students.

The following n lines each contain a student's name (a string without spaces) and an integer score, separated by a space.

outputFormat

Output a single line containing the name of the student with the second highest score. If no such score exists, output No second highest score.

5
Alice 50
Bob 70
Charlie 70
Dave 60
Eve 55

Dave