#include <bits/stdc++.h>

using namespace std;

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

long n,meniu,x,poz,ordine[200005];
set<long> heap;

int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
    {
        fin>>meniu;
        if(meniu!=3)
            fin>>x;
        switch(meniu)
        {
        case 1:
        {
            heap.insert(x);
            ordine[++poz]=x;
        }
        break;
        case 2:
            heap.erase(ordine[x]);
            break;
        case 3:
            fout<<*heap.begin()<<endl;
            break;
        }
    }
    return 0;
}