//
//  main.cpp
//  heap1
//
//  Created by Vlad Calomfirescu on 27.04.2021.
//

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

using namespace std;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int  f[200000];
set<int> heap;
int main()
{
    int val,val1,n,op,k=1;
    fin>>n;
    for (int i = 0; i<n; i++)
    {
        fin>>op;
        switch (op)
        {
            case 1:
                fin>>val;
                heap.insert(val);
                f[k++] = val;
                break;
            case 2:
                fin>>val1;
                heap.erase(f[val1]);
                break;
            case 3:
                fout<<*heap.begin()<<endl;
                break;
        }
    }
    return 0;
}