hdu4557NavigableSet

import java.io.BufferedInputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.NavigableSet;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeSet;

import javax.swing.text.NavigationFilter;




public class Main {


    public static void main(String[] args) throws IOException{

           StreamTokenizer cin = new StreamTokenizer(new BufferedInputStream(System.in)); 
           InputReader in = new InputReader(System.in)  ;
           PrintWriter out = new PrintWriter(System.out) ;

           int t = in.nextInt() ;
           for(int cas = 1 ; cas <= t ; cas++){
                out.println("Case #"+ cas + ":") ;
                new Task().solve(in, out)  ;  // out.flush() ;
           }

           out.flush() ; 


    }


}

class   Task{

        static class Man implements Comparable<Man>{

                String  name ;
                int     val ; 
                int     id  ;

                Man(String name , int val , int id){
                      this.name = name ;
                      this.val = val ;
                      this.id = id  ;
                }

                public int compareTo(Man o){
                       if(val != o.val)  return Integer.compare(val, o.val) ; 
                       else return Integer.compare(id, o.id) ;
                }

        }       

          public void solve(InputReader  in , PrintWriter out) throws IOException{
                 int n = in.nextInt() ;
                 NavigableSet<Man> st = new TreeSet<Task.Man>() ;
                 for(int i = 0 ; i < n ; i++){
                      if(in.next().equals("Add")){
                             st.add(new Man(in.next(), in.nextInt(), i)) ;
                             out.println(st.size()) ;
                      }
                      else{
                             Man m = st.ceiling(new Man("", in.nextInt(), -1)) ;
                             if(m == null) out.println("WAIT...");
                             else{
                                 out.println(m.name) ;
                                 st.remove(m) ;
                             }
                      }
                 }

          }

}





class InputReader{
        public BufferedReader  reader;
        public StringTokenizer  tokenizer;

        public InputReader(InputStream stream){
                    reader = new BufferedReader(new InputStreamReader(stream), 32768) ;
                    tokenizer = null ;
        }

        public String next(){
                    while(tokenizer == null || ! tokenizer.hasMoreTokens()){
                        try{
                                tokenizer = new StringTokenizer(reader.readLine());
                        }catch (IOException e) {
                                throw new RuntimeException(e);
                        }
                    }
                    return tokenizer.nextToken();
        }

        public int nextInt() {
                    return Integer.parseInt(next());
        }

        public long nextLong() {
                    return Long.parseLong(next());
        }

}