#include <bits/stdc++.h>

using namespace std;

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

set<int>heap;
int poz[200001];
int n, op, val, pos, t;

int main()
{
    fin>>t;
    for(int q=1; q<=t; ++q)
    {
        fin>>op;
        if(op==3) fout<<*heap.begin()<<"\n";
        else if(op==1)
        {
            fin>>val;
            heap.insert(val);
            poz[++n]=val;
        }
        else
        {
            fin>>pos;
            heap.erase(poz[pos]);
        }
    }
    return 0;
}