{"raw_statement":[{"iden":"problem statement","content":"The Republic of AtCoder has $N$ mountains. The $i$\\-th mountain has a name $S_i$ and a height of $T_i$.\nReturn the name of the second highest mountain there. It is guaranteed that all the mountains have different names and different heights."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 1000$\n*   $1 \\leq ({}$the length of $S_i) \\leq 15$\n*   $1 \\leq T_i \\leq 10^5$\n*   $S_i \\neq S_j \\ (i \\neq j)$\n*   $T_i \\neq T_j \\ (i \\neq j)$\n*   $S_i$ consists of uppercase English letters, lowercase English letters, and digits.\n*   $N$ and $T_i$ are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$S_1$ $T_1$\n$S_2$ $T_2$\n$\\vdots$\n$S_N$ $T_N$"},{"iden":"sample input 1","content":"3\nEverest 8849\nK2 8611\nKangchenjunga 8586"},{"iden":"sample output 1","content":"K2\n\nThe second highest mountain in the world is K2."},{"iden":"sample input 2","content":"4\nKita 3193\nAino 3189\nFuji 3776\nOkuhotaka 3190"},{"iden":"sample output 2","content":"Kita\n\nThe second highest mountain in Japan is Kita-dake."},{"iden":"sample input 3","content":"4\nQCFium 2846\nchokudai 2992\nkyoprofriends 2432\npenguinman 2390"},{"iden":"sample output 3","content":"QCFium"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}