#include <fstream>
#include <set>
#include <unordered_map>
using namespace std;
int main() {
    ifstream f("heapuri.in");
    ofstream g("hepuri.out");
    long long n,op,x;
    f>>n;
    unordered_map<long,long>cron;
    set<long long> heap;
    long long contor = 1;
    for(auto i = 0;i<n;i++)
    {
        f>>op;
        switch (op) {
            case 1: {
                f >> x;
                cron[contor] = x;
                heap.insert(x);
                contor++;
                break;
            }
            case 2:
            {
                f>>x;
                heap.erase(cron[x]);
                break;
            }
            case 3:
            {
                g<<*heap.begin()<<'\n';
                break;
            }
        }

    }

    return 0;
}