#include <iostream>
#include <fstream>
#include <set>
using namespace std;

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

std::set<int> heap;
const int N = 200000;
int n, nr, cod, val, v[200001];

void inserare(int val)
{v[++nr] = val;
heap.insert(val);
}

void stergere(int val)
{heap.erase(v[val]);
}

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

int main()
{fin >> n;
for (int i = 1; i <= n; i++)
    {fin >> cod;
    if (cod == 1)
        {fin >> val;
        inserare(val);
        }
        else if (cod == 2)
        {fin >> val;
        stergere(val);
        }
        else if (cod == 3)
        {int valoaremin = valMinima();
            fout << valoaremin << '\n';
        }
    }
    fin.close();
    fout.close();
    return 0;
}