Medal Standings

Problem Description

After a sports meet, the medal standings of all participating countries must be compiled. Each country has a name, and a number of gold, silver, and bronze medals. The ranking rules are as follows:

• Gold medals: more comes first;
• If gold medals are equal, more silver medals comes first;
• If silver medals are also equal, more bronze medals comes first;
• If bronze medals are also equal, order by country name in ascending lexicographic order.

If two countries have exactly the same numbers of gold, silver, and bronze medals, they share the same rank. Subsequent ranks are assigned by the actual position after sorting. For example, after two countries tied at rank 1, the next country is rank 3.

Input Format

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

The following $n$ lines each contain a country's information: its name, number of gold medals, number of silver medals, and number of bronze medals. The country name contains no spaces.

Output Format

Output $n$ lines. Each line has the format: rank name gold silver bronze.

Sample Input

5
China 10 8 5
USA 10 10 3
Japan 8 12 10
Korea 10 10 3
France 5 5 5

Sample Output

1 Korea 10 10 3
1 USA 10 10 3
3 China 10 8 5
4 Japan 8 12 10
5 France 5 5 5

Sample Explanation

There are $5$ countries in total. After sorting:

• Korea and USA both have $10$ gold, $10$ silver, and $3$ bronze, so they tie for rank $1$. Since "Korea" precedes "USA" lexicographically, Korea is listed first.
• China has $10$ gold, $8$ silver, $5$ bronze. Its gold equals Korea's and USA's, but it has fewer silver, so it ranks after them as rank $3$.
• Japan has $8$ gold, $12$ silver, $10$ bronze, with fewer gold than the top three, so it is rank $4$.
• France has $5$ gold, $5$ silver, $5$ bronze, the fewest gold, so it is rank $5$.

Constraints

$1 \le n \le 10000$.