#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <stack>
#include <map>
 
using namespace std;
 
#define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss));
 
typedef  long long LL;
 
template<class T> void read(T&num) {
    char CH; bool F=false;
    for(CH=getchar();CH<‘0‘||CH>‘9‘;F= CH==‘-‘,CH=getchar());
    for(num=0;CH>=‘0‘&&CH<=‘9‘;num=num*10+CH-‘0‘,CH=getchar());
    F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {
    if(!p) { puts("0"); return; }
    while(p) stk[++ tp] = p%10, p/=10;
    while(tp) putchar(stk[tp--] + ‘0‘);
    putchar(‘\n‘);
}
 
const LL mod=1e9+7;
const double PI=acos(-1.0);
const int inf=1e18;
const int N=1e5+10;
const int maxn=5e3+4;
const double eps=1e-12;

stack<int>a,b,c,d;

char s[10],st[10],str[10];

LL temp[N];
int main()
{
    int Case=0;
    LL x;
    while(1)
    {
        int n,cnt=0;
        read(n);
        if(n==0)break;
        while(!a.empty())a.pop();
        while(!b.empty())b.pop();
        while(!c.empty())c.pop();
        printf("Case #%d:\n",++Case);
        For(i,1,n)
        {
            scanf("%s%s",s,str);
            if(s[0]==‘p‘)
            {
                if(s[1]==‘u‘)
                {
                    scanf("%lld",&x);
                    temp[++cnt]=x;
                    if(str[0]==‘A‘)a.push(cnt);
                    else b.push(cnt);
                }
                else 
                {
                    if(str[0]==‘A‘&&!a.empty())
                    {
                        printf("%lld\n",temp[a.top()]);
                        a.pop();
                    }
                    else if(str[0]==‘B‘&&!b.empty())
                    {
                        printf("%lld\n",temp[b.top()]);
                        b.pop();
                    }
                    else 
                    {
                        printf("%lld\n",temp[c.top()]);
                        c.pop();
                    }
                }
            }
            else 
            {
                scanf("%s",st);
                while(!a.empty()||!b.empty())
                {

                    int A,B;
                    if(a.empty())A=0;
                    else A=a.top();
                    if(b.empty())B=0;
                    else B=b.top();
                    if(A>B)
                    {
                        a.pop();
                        d.push(A);
                    }
                    else 
                    {
                        b.pop();
                        d.push(B);
                    }
                }
                while(!d.empty())
                {
                    c.push(d.top());
                    d.pop();
                }    
            }
        }
    }
    return 0;
}