#include <bits/stdc++.h>
using namespace std;
ifstream F ("heapuri.in");
ofstream G ("heapuri.out");
set <int> heap;
int main()
{
    int n, op, ord[200001], x, k = 0;
    F>>n;
    for(int i = 0; i < n; i++)
    {
        F>>op;
        if(op == 1)
        {
            F>>x;
            ord[++k] = x;
            heap.insert(x);
        }
        if(op == 2)
        {
            F>>x;
            heap.erase(ord[x]);
        }
        else if (op == 3)
            G<<*heap.begin()<<endl;

    }
    return 0;
}