A tournament tracks each player's score and number of wins. Produce the final standings by sorting the players with this exact comparator:

1. Higher score ranks first.
2. If scores tie, higher wins ranks first.
3. If both tie, the player whose name is lexicographically smaller ranks first.

Player names are lowercase letters only and are guaranteed to be distinct, so the ordering is uniquely determined.

Input format

Line 1: an integer n — the number of players. Next n lines: each contains name score wins separated by single spaces.

Output format

Print n lines. Line i contains name score for the player ranked i-th (1-indexed) in the standings. (Wins are used only for ordering and are not printed.)

Constraints

• 1 ≤ n ≤ 100000
• 0 ≤ score ≤ 1000000000
• 0 ≤ wins ≤ 1000000
• Each name is 1–20 lowercase Latin letters; all names are distinct.

3
alice 50 3
bob 50 5
cara 40 9

bob 50
alice 50
cara 40

2
zoe 10 2
abe 10 2

abe 10
zoe 10