Description

At the beginning of the semester, the teacher wants to collect everyone's birthday and sort them from earliest to latest.

Input Format

The first line contains an integer $n$ ($1≤n≤100$), representing the number of students in the class.
The next $n$ lines each contain a string $s$ and three integers $y$, $m$, $d$, indicating that the student named $s$ was born on $y$ year $m$ month $d$ day.
All dates are guaranteed to be valid, and the name consists of lowercase letters and is no more than $20$ characters long.

Output Format

Output $n$ lines, each containing a string representing a name. If two students have the same birth date, the one who appears later in the input should be output first.

Sample

3
qwb 1996 6 30
gyt 1995 7 28
wc  1996 6 30

gyt
wc
qwb