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

int main()
{
    ifstream f("heapuri.in");
    ofstream g("heapuri.out");
    int n, a, b,k=0;
    f >> n;
    vector<int>v(n);
    set<int>minHeap;

    for (int i = 0; i < n; i++)
    {
        f >> a;
        if (a == 1)
        {
            f >> b;
            minHeap.insert(b);
            v[k]=b;
            k++;
        }
        else if (a == 2)
        {
            f >> b;
            minHeap.erase(v[b-1]);
        }
        else if (a == 3)
        {
            if (!minHeap.empty())
            {
                g <<*minHeap.begin() << endl;
            }
        }
    }

    f.close();
    g.close();
    return 0;
}