// Robert LiKamWa
// Solution to 2006 BHCSI Contest Problem Games
import java.io.*;
import java.util.*;

public class games implements Comparable{
	String name;
	int clicks;
	
	public games (String s, int c){
		name = s;
		clicks = c;
	}
	public static void main (String[] args) throws IOException {
		Scanner s = new Scanner(new File("games.in"));
		int inputs = s.nextInt();
		games [] adv = new games[inputs];
		games [] act = new games[inputs];
		games [] puz = new games[inputs];
		games [] arc = new games[inputs];
		
		int numadv = 0;
		int numact = 0;
		int numpuz = 0;
		int numarc = 0;
		
		for (int i =0;i<inputs;i++){
			adv[i] = new games("",0);
			act[i] = new games("",0);
			puz[i] = new games("",0);
			arc[i] = new games("",0);
			
			int clicks = s.nextInt();
			String genre = s.next();
			String name = s.next();
			if (genre.equalsIgnoreCase("adventure")){
				adv[numadv]=new games(name,clicks);
				numadv++;		
			}else if (genre.equalsIgnoreCase("action")){
				act[numact]=new games(name,clicks);
				numact++;
			}
			else if (genre.equalsIgnoreCase("puzzle")){
				puz[numpuz]=new games(name,clicks);
				numpuz++;
			}
			else {
				arc[numarc]=new games(name,clicks);
				numarc++;
			}
		}
		Arrays.sort(arc);
		Arrays.sort(act);
		Arrays.sort(puz);
		Arrays.sort(adv);
		
		System.out.println("Action\n------------");
		for (int i =0;i<5; i++){
			System.out.println((i+1)+". "+act[i].name);
		}System.out.println();
		
		System.out.println("Adventure\n------------");
		for (int i =0;i<5; i++){
			System.out.println((i+1)+". "+adv[i].name);
		}System.out.println();
		
		System.out.println("Arcade\n------------");
		for (int i =0;i<5; i++){
			System.out.println((i+1)+". "+arc[i].name);
		}System.out.println();
		
		System.out.println("Puzzle\n------------");
		for (int i =0;i<5; i++){
			System.out.println((i+1)+". "+puz[i].name);
		}System.out.println();
	}
	
	public int compareTo(Object o){
		games other = (games)o;
		if (this.clicks<other.clicks){
			return 1;
		}
		if (this.clicks>other.clicks){
			return -1;
		}
		return name.compareTo(other.name);
	}
}