The city aquarium keeps a flat staff roster instead of a management tree: every keeper has a unique staff id, a display name, a monthly stipend, and the id of the senior keeper who signs off on their schedule (or 0 if they answer to no one). An old payroll migration froze several senior keepers' pay at outdated levels, so today a number of keepers who report to a supervisor are actually paid more than that supervisor. Given the full roster, list every keeper whose stipend is strictly greater than the stipend of the senior keeper who supervises them.

Input format

• Line 1: a single integer n, the number of keepers on the roster.
• Each of the next n lines describes one keeper as four space-separated tokens: id name stipend supervisorId.
  • id is the keeper's unique staff id.
  • name is the keeper's display name (letters and digits only, no spaces).
  • stipend is the keeper's monthly stipend.
  • supervisorId is the staff id of the keeper who supervises them, or 0 if they have no supervisor.
• The n lines may appear in any order (not necessarily sorted by id).

Output format

Print the name of every keeper whose stipend is strictly greater than their supervisor's stipend, one name per line, ordered by increasing staff id. A keeper with supervisorId = 0 never qualifies. If no keeper qualifies, print nothing.

Constraints

• 1 <= n <= 10^4
• The staff ids appearing on the roster are exactly the integers 1..n, each appearing exactly once.
• For every keeper, supervisorId is either 0 or the id of a different keeper on the roster.
• The supervision links never form a cycle (each keeper has finitely many keepers above them, ending at a keeper with supervisorId = 0).
• 1 <= stipend <= 10^9
• Each name has between 1 and 20 characters.

5
1 Nora 30000 3
2 Meg 90000 3
3 Priya 80000 0
4 Omar 45000 3
5 Kira 15000 1

Meg

6
1 Ana 50000 0
2 Bo 40000 1
3 Cy 60000 1
4 Dee 60000 3
5 Eli 65000 3
6 Fay 20000 2

Cy
Eli