#include <iostream>
#include <fstream>
#include <set>

using namespace std;

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

set<int> Heap;

int n, operatie, x, k, poz[300001];

int main()
{
    f >> n;
    for(int i = 0; i < n; i++)
    {
        f >> operatie;
        if(operatie == 1)
        {
            f >> x;
            poz[++k] = x;
            Heap.insert(x);
        }
        else if(operatie == 2)
        {
            f >> x;
            Heap.erase(poz[x]);
        } else
            g << *Heap.begin() << '\n';
    }

    return 0;
}