Contest Duration: - (local time) (100 minutes) Back to Home
B - Do you know the second highest mountain? /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

AtCoder国には N 個の山があり、i 個目の山の名前は S_i, 高さは T_i です。

2 番目に高い山の名前を答えてください。N 個の山の名前、高さはそれぞれ相異なることが保証されます。

### 制約

• 2 \leq N \leq 1000
• 1 \leq (S_i の長さ{}) \leq 15
• 1 \leq T_i \leq 10^5
• S_i \neq S_j \ (i \neq j)
• T_i \neq T_j \ (i \neq j)
• S_i は英小文字、英大文字、数字のみからなる
• N,\ T_i は整数

### 入力

N
S_1 T_1
S_2 T_2
\vdots
S_N T_N


### 出力

2 番目に高い山の名前を出力せよ。

### 入力例 1

3
Everest 8849
K2 8611
Kangchenjunga 8586


### 出力例 1

K2


### 入力例 2

4
Kita 3193
Aino 3189
Fuji 3776
Okuhotaka 3190


### 出力例 2

Kita


### 入力例 3

4
QCFium 2846
chokudai 2992
kyoprofriends 2432
penguinman 2390


### 出力例 3

QCFium


Score : 200 points

### Problem Statement

The Republic of AtCoder has N mountains. The i-th mountain has a name S_i and a height of T_i.

Return the name of the second highest mountain there. It is guaranteed that all the mountains have different names and different heights.

### Constraints

• 2 \leq N \leq 1000
• 1 \leq ({}the length of S_i) \leq 15
• 1 \leq T_i \leq 10^5
• S_i \neq S_j \ (i \neq j)
• T_i \neq T_j \ (i \neq j)
• S_i consists of uppercase English letters, lowercase English letters, and digits.
• N and T_i are integers.

### Input

Input is given from Standard Input in the following format:

N
S_1 T_1
S_2 T_2
\vdots
S_N T_N


### Output

Print the name of the second highest mountain.

### Sample Input 1

3
Everest 8849
K2 8611
Kangchenjunga 8586


### Sample Output 1

K2


The second highest mountain in the world is K2.

### Sample Input 2

4
Kita 3193
Aino 3189
Fuji 3776
Okuhotaka 3190


### Sample Output 2

Kita


The second highest mountain in Japan is Kita-dake.

### Sample Input 3

4
QCFium 2846
chokudai 2992
kyoprofriends 2432
penguinman 2390


### Sample Output 3

QCFium