#include <iostream>
#include <fstream>
#include <set>
#define nmax 200001

using namespace std;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");

int n,m,v[nmax];
set<int> heap;

int main()
{
    fin>>n;
    int operatie,x;
    for(int i=0;i<n;i++)
     {
        fin>>operatie;
        if(operatie==1)
        {
            fin>>x;
            heap.insert(x);
            v[m++]=x;
        }
        else if(operatie==2)
              {
               fin>>x;
               heap.erase(v[x-1]);
              }
           else
            fout<<*heap.begin()<<'\n';
    }
    return 0;
}