#include <vector>
#include <set>
#include <fstream>

using namespace std;

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

vector <long long> poz;
set <long long> heap;


int main()
{
    long N, x;
    f >> N;
    int op;
    for(long i = 0; i < N; i++)
    {
        f >> op;
        if(op == 1) {
            f >> x;
            heap.insert(x);
            poz.push_back(x);
        }
        if(op == 2)
        {
            f >> x;
            heap.erase(poz[x-1]);
        }
        if(op == 3)
        {
            int first = *heap.begin();
            g << first <<'\n';
        }
    }
    return 0;
}