#include <iostream>
#include <fstream>
#include <set>
#include <algorithm>
#define NMAX 200005
using namespace std;
set <int> heap;
int n, v[NMAX], k, x, y;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int main()
{
    f >> n;
    for(int i = 1; i <= n; i++)
    {
        f >> x;
        if(x == 1)
        {
            f >> y;
            heap.insert(y);
            v[++k] = y;
        }
        else if(x == 2)
        {
            f >> y;
            heap.erase(v[y]);
        }
        else
            g << *heap.begin() << '\n';
    }
    return 0;
}