#include <iostream>
#include <fstream>
#include <vector>
#include <set>
using namespace std;

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

set < int >  heap;
vector < int > introdus;
int task, x, n;

int main()
{
    in >> n;

    for(int i = 0; i < n; ++i)
    {
        in >> task;

        if(task == 1 || task == 2) in >> x;

        if(task == 1)
        {
            heap.insert(x);
            introdus.push_back(x);
        }

        if(task == 2)
        {
            heap.erase(introdus[x - 1]);
        }

        if(task == 3)
        {
            out << *heap.begin() << "\n";
        }

    }

    return 0;
}