Codeforces Beta Round 59 (Div. 2)
A
Sinking Ship
Codeforces
900
原题
←B →
翻译中…

The ship crashed into a reef and is sinking. Now the entire crew must be evacuated. All $*n*$ crew members have already lined up in a row (for convenience let's label them all from left to right with positive integers from 1 to $*n*$) and await further instructions. However, one should evacuate the crew properly, in a strict order. Specifically:

翻译中…

The first crew members to leave the ship are rats. Then women and children (both groups have the same priority) leave the ship. After that all men are evacuated from the ship. The captain leaves the sinking ship last.

翻译中…

If we cannot determine exactly who should leave the ship first for any two members of the crew by the rules from the previous paragraph, then the one who stands to the left in the line leaves the ship first (or in other words, the one whose number in the line is less).

翻译中…

For each crew member we know his status as a crew member, and also his name. All crew members have different names. Determine the order in which to evacuate the crew.

翻译中…

Input

翻译中…

The first line contains an integer $*n*$, which is the number of people in the crew ($1 ≤ *n* ≤ 100$). Then follow $*n*$ lines. The $*i*$-th of those lines contains two words — the name of the crew member who is $*i*$-th in line, and his status on the ship. The words are separated by exactly one space. There are no other spaces in the line. The names consist of Latin letters, the first letter is uppercase, the rest are lowercase. The length of any name is from 1 to 10 characters. The status can have the following values: rat for a rat, woman for a woman, child for a child, man for a man, captain for the captain. The crew contains exactly one captain.

翻译中…

Output

翻译中…

Print $*n*$ lines. The $*i*$-th of them should contain the name of the crew member who must be the $*i*$-th one to leave the ship.

翻译中…

样例

Input #1
6
Jack captain
Alice woman
Charlie man
Teddy rat
Bob child
Julia woman
Output #1
Teddy
Alice
Bob
Julia
Charlie
Jack
InputCopy OutputCopy
题目信息
题号
63A
时间限制
2 s
内存限制
256 MB
标签
模拟
排序
字符串

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。