#include <fstream>
#include <set>
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
int ordine[200001];
set <int> heap;
int main()
{
    int n,i,tip,x,j = 0;
    cin >> n;
    for(i = 0;i < n;i++){
        cin >> tip;
        if(tip!=3)
            cin >> x;
        if(tip == 1){
            ordine[++j] = x;
            heap.insert(x);
        }else if(tip == 2){
            heap.erase(ordine[x]);
        }else{
            cout << *heap.begin() << "\n";
        }
    }
    return 0;
}