#include <iostream>
#include <fstream>
#include <set>
using namespace std;

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

set<int>h;//min-heap
int place[200001];
int main()
{
    int m, p, x, i, k=0;
    fin>>m;
    for(i=1; i<=m; i++)
    {
        fin>>p;
        if(p==1)
        {
            fin>>x;
            h.insert(x);
            place[++k]=x;
        }
        else if(p==2)
        {
            fin>>x;
            h.erase(place[x]);
        }
        else
        {
            fout<<*h.begin()<<"\n";
        }
    }
}