PROGRAMMING:Address book sorting
Input the information of n friends, including name, birthday, telephone number, the problem requires the preparation of procedures, in accordance with the order of age from big to small output address book. The title guarantees that everyone's birthday is different.
###Input format:
Enter the first line to give a positive integer n ($$< $$10). Then n lines, each line gives a friend's information according to the format of "name, birthday and telephone number", where "name" is a string composed of English letters no more than 10 in length, "birthday" is a date in the format of "yyyymmdd", and "telephone number" is a string composed of no more than 17 digits and '+', '-'.
###Output format:
According to the age of children from old to young output information, the same format as the output.
###Input example:
```in
three
zhang 19850403 13912345678
wang 19821020 +86-0571-88018448
qian 19840619 13609876543
```
###Output example:
```out
wang 19821020 +86-0571-88018448
qian 19840619 13609876543
zhang 19850403 13912345678
```
answer：If there is no answer, please comment
###Input format:
Enter the first line to give a positive integer n ($$< $$10). Then n lines, each line gives a friend's information according to the format of "name, birthday and telephone number", where "name" is a string composed of English letters no more than 10 in length, "birthday" is a date in the format of "yyyymmdd", and "telephone number" is a string composed of no more than 17 digits and '+', '-'.
###Output format:
According to the age of children from old to young output information, the same format as the output.
###Input example:
```in
three
zhang 19850403 13912345678
wang 19821020 +86-0571-88018448
qian 19840619 13609876543
```
###Output example:
```out
wang 19821020 +86-0571-88018448
qian 19840619 13609876543
zhang 19850403 13912345678
```
answer：If there is no answer, please comment