#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<deque>
using namespace std;
string str,name;
deque<string> de;
int n,l;
int main() {
	scanf("%d",&n);
	for(int i=1; i<=n; i++) {
		cin>>name>>str;
		if(str=="UP") {
			de.push_back(name);
		}
		if(str=="DOWN") {
			de.push_front(name);
		}
		if(str=="SAME") {
			while(de.size()) {
				cout<<de.front()<<endl;
				de.pop_front();
			}
			cout<<name<<endl;
		}
	}
	while(de.size()) {
		cout<<de.front()<<endl;
		de.pop_front();
	}
	return 0;
}