A. Sinking Ship

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Sample test(s)

input

6
Jack captain
Alice woman
Charlie man
Teddy rat
Bob child
Julia woman

output

Teddy
Alice
Bob
Julia
Charlie
Jack

解题说明：此题其实就是字符串按序输出问题，题目用了一个泰坦尼克号的描述，先让rat（居然是老鼠？）走，再让女人和孩子走，船长最后走，我们只需要记住这三类人即可，其他人都肯定介于女人孩子和船长之间。只需要对每个字符串根据身份设定一个标记，然后通过判断标记决定是否输出即可。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;

int main()
{
	int n,i,a[105],j;
	char s[105][13],t[13];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%s %s",&s[i],&t);
		if(strcmp(t,"rat")==0)
		{
			a[i]=0;
			printf("%s\n",s[i]);
		}
		else if(strcmp(t,"woman")==0||strcmp(t,"child")==0)
		{
			a[i]=1;
		}
		else if(strcmp(t,"captain")==0)
		{
			a[i]=3;
		}
		else
		{
			a[i]=2;
		}
	}
	for(j=1;j<=3;j++)
	{
		for(i=0;i<n;i++)
		{
			if(a[i]==j)
			{
				printf("%s\n",s[i]);
			}
		}
	}

	return 0;
}