#include <iostream>
#include <fstream>
#include <bits/stdc++.h>

using namespace std;

ifstream f ("heapuri.in");
ofstream g ("heapuri.out");

int main()
{
    set<int> h;
    int n;
    f >> n;

    vector<int> ordine;

    for (int i = 1; i <= n; ++i)
    {
        int tip;
        f >> tip;
        switch(tip)
        {
        case 1:
        {
            int x;
            f >> x;
            h.insert(x);
            ordine.push_back(x);
            break;
        }
        case 2:
        {
            int x;
            f >> x;
            h.erase(ordine[x-1]);
            break;
        }
        case 3:
            g << *h.begin() << '\n';
            break;
        }
    }
    return 0;
}