program heap;
const INF = 999999999;
var H : array [1..200001] of longint;
    k,i,n,t,j,b,a,min,l : longint;

begin
   assign(input,'heapuri.in'); reset(input);
   assign(output,'heapuri.out'); rewrite(output);
   readln(t);  n:=0; l:=0;
   for i:=1 to t do begin
                         read(a);
                         if a=1 then begin
                                           readln(b);
                                           n:=n+1;
                                           H[n]:=b;

                                     end else
                         if a=2 then begin
                                           readln(b);
                                           H[b]:=INF;
                                     end else
                          if a=3 then begin
                                            min:=H[1];
                                            for j:=2 to n do
                                             if H[j]<min then min:=H[j];
                                             writeln(min);
                                             readln;
                                     end;
   end;
   close(input);
   close(output);
end.