#include <fstream>
#include <set>
#include <vector>
using namespace std;
int i,n,op,x;
multiset<int>heap;
vector<int>v;
int main()
{
    ifstream f("heapuri.in");
    ofstream g("heapuri.out");
    f>>n;
    for (i=0;i<n;i++)
    {
        f>>op;
        if (op==1)
        {
            f>>x;
            heap.insert(x);
            v.push_back(x);
        }
        else if (op==2)
        {
            f>>x;
            heap.erase(heap.find(v[x-1]));
        }
          else
          {
            g<<*heap.begin()<<endl;
          }
    }
    f.close();
    g.close();
    return 0;
}