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

#define NMAX 200005
using namespace std;

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

set<int> heap;

int n, poz[NMAX], k, a, x;

int main()
{
    f >> n;

    for(int i=0; i<n; i++)
    {
    f >> x;
    switch(x)
    {
    case 1:
        f >> a;
        heap.insert(a);
        poz[++k] = a;
        break;
    case 2:
        f >> a;
        heap.erase(poz[a]);
        break;
    case 3:
        g << *heap.begin() << '\n';
        break;
    }
    }
    return 0;
}