#include <bits/stdc++.h>

using namespace std;

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

set <int> q;
int f[200001], k;

int main()
{
    int n, c, x;
    in >> n;
    for (int i = 1; i <= n; ++i)
    {
        in >> c;
        if (c == 1)
        {
            in >> x;
            q.insert(x);
            f[++k] = x;
        }
        else if (c == 2)
        {
            in >> x;
            q.erase(f[x]);
        }
        else
            out << *q.begin() << '\n';
    }
    return 0;
}