Таблица первенства
Once upon a time, in the archives of Byteland, an ancient table was found. The best scientists of Byteland identi ed this table as a scoreboard of the very first Byteland football championship. The table itself was in perfect condition only a few numbers were missing.
You need to help Byteland scientists to reconstruct the missing numbers based on the content of the table, or determine that unambiguous reconstruction is impossible.
Input
The first line of the input le holds a single positive integer number 2 ≤ N ≤ 3·10^5 the number of teams that participated in the very rst Byteland football championship. Each of the next N lines consists of the scoreboard itself. The championship was conducted in one round, which means that each team played with each other only once.
Each line of the scoreboard shows the performance of one team in the following format: 1 ≤ i ≤ N place of the team in the overall championship results, N_i - string of at most 300 Latin characters representing the name of the team, N-1 - the same integer representing the number of games played by each team, 0 ≤ W_i ≤ N-1 number of matches won, 0 ≤ D_i ≤ N-1 - number of draws, 0 ≤ L_i ≤ N-1 - number of games lost, 0 ≤ S_i ≤ 3(N-1) - number of score points earned by the team (each victory, draw and loss gives a team 3, 1 and 0 points respectively). Elements in the line are separated by a single space. The table is sorted by the number of score points in descending order (and therefore in the ascending order of places). Some of the Wi;Di;Li; Si can be replaced by -1 that means that the number is missing. It is guaranteed that the provided table can be constructed from a correct table by replacement of at most three numbers by -1. Help Bytelanders to reconstruct the scoreboard!
Output
Output the name of the team in the i+1 line, where i is the minimum of reconstructed numbers or -1 if i is greater than N unambiguous reconstruction is impossible.