#include <fstream>
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");

long H[2000013],poz_heap[200013],poz_intr[200013];
long k,i,n,a,b,t,j,l,nod;

void coboara(long nod)
{
  long fiu;
  do {
      fiu=0;
      if (nod*2<=n){
                    fiu=nod*2;
                    if(nod*2<n && H[nod*2+1]<H[nod*2]) fiu=nod*2+1;
                    if (H[fiu]>=H[nod]) fiu=0;
                    }
      if (fiu){
               swap(poz_intr[poz_heap[nod]],poz_intr[poz_heap[fiu]]);
               swap(poz_heap[nod],poz_heap[fiu]);
               swap(H[nod],H[fiu]);
               nod=fiu;
              }
      }
  while(fiu);
}
 
void ridica(long nod)
{
 if (nod>1 && H[nod]<=H[nod/2]){
                                swap(poz_intr[poz_heap[nod]],poz_intr[poz_heap[nod/2]]);
                                swap(poz_heap[nod],poz_heap[nod/2]);
                                swap(H[nod],H[nod/2]);
                                ridica(nod/2);
                                }
}
 
void sterge(long &n, long nod)
{
 swap(poz_intr[poz_heap[nod]],poz_intr[poz_heap[n]]);
 swap(poz_heap[nod],poz_heap[n]);
 swap(H[nod],H[n]);
 --n;
 if (nod>1 && H[nod]<H[nod/2]) ridica(nod);
                         else coboara(nod);
}
 
void inserare(long &n,long &l, long nod) 
{
 H[++n]=nod;
 poz_heap[n]=++l;
 poz_intr[l]=n;
 ridica(n);
}
 
int main()
{
 cin>>t;
 while(t--){
            cin>>a;
            if (a==1) cin>>b, inserare(n,l,b);
            if (a==2) cin>>b, sterge(n,poz_intr[b]);
            if (a==3) cout<<H[1]<<"\n";
           }
return 0;
}