program heap;
var H,sol : array [1..200000] of longint;
    k,i,n,a,b,t,j,l : longint;

function tata( nod : longint) : longint;
    begin
       tata:=nod div 2;
    end;
function fiu_sting( nod : longint) : longint;
    begin
       fiu_sting:=nod * 2;
    end;
function fiu_drept( nod : longint) : longint;
    begin
       fiu_drept:=nod * 2+1;
    end;

procedure swap(var x,y : longint);
  var aux : longint;
    begin
       aux:=x;
       x:=y;
       y:=aux;
    end;


procedure coboara( n, k : longint);
  var fiu : longint;
    begin
         repeat
               fiu:=0;
               if fiu_sting(k)<n then
                  begin
                       fiu:=fiu_sting(k);
                       if H[fiu_drept(k)]<H[fiu_sting(k)] then fiu:=fiu_drept(k);
                       if H[fiu]>=H[k] then fiu:=0
                  end
                                  else  if fiu_sting(k)=n then
                                        begin
                                              fiu:=fiu_sting(k);
                                              if H[fiu]>=H[k] then fiu:=0;
                                        end;
                  if fiu<>0 then begin
                                       swap(H[k],H[fiu]);
                                       k:=fiu;
                                 end;

         until fiu=0;
   end;

procedure ridica(n,k : longint);
   var aux: longint;
     begin
       aux:=H[k];
         while ((k<>1)and(aux<H[tata(k)])) do begin
                                                   swap(H[k],H[tata(k)]);
                                                   k:=tata(k);
                                             end;
         H[k]:=aux;
       end;

procedure construieste(n : longint);
 begin
   for i:=n div 2 downto 1 do
       coboara(n,i);
   end;

procedure sterge(var n : longint ; k : longint);
  begin
    H[k]:=H[n];
    n:=n-1;
    if ((k>1) and (H[k]>H[tata(k)])) then ridica(n,k)
                                     else coboara(n,k);
  end;

procedure inserare(var n,l  : longint; k : longint) ;
  begin
      n:=n+1;
      H[n]:=k;
      l:=l+1;
      sol[l]:=k;
      ridica(n,n);
   end;



begin
   assign(input,'heapuri.in'); reset(input);
   assign(output,'heapuri.out'); rewrite(output);
   readln(t);
   for k:=1 to t  do begin

      read(a);
      if a=3 then begin readln;
                        construieste(n);
                        writeln(H[1]);
                  end;
      if a=2 then begin
                       readln(b);
                       for j:=1 to n do
                                       if sol[b]=H[j] then sterge(n,j);
                  end;
      if a=1 then begin
                       readln(b);
                       inserare(n,l,b);
                       end;

               end;
   close(input);
   close(output);
end.