#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
vector<string> queue;
vector<string> queue_w;
for (int i=0;i<=n;i++)
{
string event;
getline(cin, event);
if(event=="start")
{
if(!queue_w.empty())
{
if(queue_w.size()==1)
{
queue.push_back(queue_w[0]);
queue_w.clear();
}
if(queue_w.size()==2)
{
queue.push_back(queue_w[0]);
queue.push_back(queue_w[1]);
queue_w.clear();
}
}
if(queue.size()>=2)
{
cout<<queue[0]<<' '<<queue[1]<<"\n";
queue_w.push_back(queue[0]);
queue_w.push_back(queue[1]);
queue.erase(queue.begin());
queue.erase(queue.begin());
}
else if(!queue.empty())
{
cout<<queue[0]<<"\n";
queue_w.push_back(queue[0]);
queue.erase(queue.begin());
}
else cout<<"Error"<<"\n";
}
else if(event.substr(0, 6)=="arrive")
{
string name=event.substr(7);
if(find(queue.begin(),queue.end(),name)==queue.end()&&find(queue_w.begin(),queue_w.end(),name)==queue_w.end())
{
queue.push_back(name);
cout<<"OK"<<"\n";
}
else cout<<"Error"<<"\n";
}
else if(event.substr(0, 5)=="leave")
{
string name=event.substr(6);
if(find(queue.begin(),queue.end(),name)!=queue.end()&&find(queue_w.begin(),queue_w.end(),name)==queue_w.end())
{
queue.erase(find(queue.begin(), queue.end(), name));
cout<<"OK"<<"\n";
}
else cout<<"Error"<<"\n";
}
}
return 0;
}