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

using namespace std;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");

set<int> heap;

int cont, valoare, v[200001];

void insert(int valoare)
{
    v[++cont] = valoare;
    heap.insert(valoare);
}

void erasev(int valoare)
{
    heap.erase(v[valoare]);
}

int minim()
{
    return *heap.begin();
}

int main()
{
    int n, nr;
     
    fin >> n;

    for (int i = 1; i <= n; i++)
    {
        fin >> nr;
        if (nr == 1)
        {
            fin >> valoare;
            insert(valoare);
        }

        else if (nr == 2)
        {
            fin >> valoare;
            erasev(valoare);
        }

        else if (nr == 3)
        {
            int minimumValue = minim();
            fout << minimumValue << endl;
        }
    }

    fin.close();
    fout.close();

    return 0;
}