#include <bits/stdc++.h>
using namespace std;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n;
set<int> heap;
vector<int> ordine;

int main()
{
    fin>>n;
    int op,x;
    ordine.push_back(0);
    for(int i=1;i<=n;i++)
    {
        fin>>op;
        if(op==3)
            fout<<*heap.begin()<<"\n";
        else
        {
            fin>>x;
            if(op==1){
                heap.insert(x);
                ordine.push_back(x);
            }
            else
            {
                heap.erase(ordine[x]);
            }
        }
    }
    return 0;
}