#include <iostream>
#include <queue>
#include <set>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");

int main()
{
    /*priority_queue<int> hyheap;

    myheap.push(val);
    myheap.top();
    myheap.pop() ///elimina top

    set<int> myheap;
    myheap.insert(val);
    myheap.erase(val);
    val = *myheap.begin(); ///iteratorul
    it = myheap.end();
    set<int>::iterator it;
    it--;
    val = *it;
    myheap.erase(myheap.find(7));*/

    set <int> myheap;
    int N, x, y;
    vector<int> v;
    f>>N;
    for(int i = 1; i <= N; i++)
    {
        f>>x; ///numarul operatiei
        if(x == 1 || x == 2)
            f>>y; ///valoarea elementului
        if(x == 1)
            myheap.insert(y), v.push_back(y);
        if(x == 2)
        {
            myheap.erase(v[y - 1]);

        }

        if(x == 3)
            g<<*myheap.begin()<<'\n';
    }
    return 0;
}