#include<iostream>
#include<stdio.h>
using namespace std;
#define N 100005
int stack1[N],top1=-1;
int stack2[N],top2=-1;
void pushQueue(int num)
{
stack1[++top1]=num;
}
int frontQueue()
{
if(top2==-1)
{
while(top1>-1)
{
int num=stack1[top1--];
stack2[++top2]=num;
}
}
return stack2[top2--];
}
bool isEmpty()
{
if(top1<=-1&&top2<=-1)
return true;
return false;
}
int main(int argc,char *argv[])
{
freopen("input.txt","r",stdin);
int i,n,num;
char ch[15];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",ch);
if(ch[1]=='U')
{
scanf("%d",&num);
pushQueue(num);
}else
{
if(isEmpty())
puts("-1");
else
printf("%d\n",frontQueue());
}
}
return 0;
}
#include<stdio.h>
using namespace std;
#define N 100005
int stack1[N],top1=-1;
int stack2[N],top2=-1;
void pushQueue(int num)
{
stack1[++top1]=num;
}
int frontQueue()
{
if(top2==-1)
{
while(top1>-1)
{
int num=stack1[top1--];
stack2[++top2]=num;
}
}
return stack2[top2--];
}
bool isEmpty()
{
if(top1<=-1&&top2<=-1)
return true;
return false;
}
int main(int argc,char *argv[])
{
freopen("input.txt","r",stdin);
int i,n,num;
char ch[15];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",ch);
if(ch[1]=='U')
{
scanf("%d",&num);
pushQueue(num);
}else
{
if(isEmpty())
puts("-1");
else
printf("%d\n",frontQueue());
}
}
return 0;
}