#include <iostream>
#include <set>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int main(){
    int N, a, b,k=0;
    fin >> N;
    vector<int>v(N);
    set<int>minHeap;

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

    fin.close();
    fout.close();
    return 0;
}