#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int op, x, N, lg, a, mini;
int v[200002], w[200002];
priority_queue<int> h;

int main()
{ 
    int i, indx, j;
    f >> N;
    for(i = 1 ; i <= N; i++)
    {
        f >> op;
        if(op == 1)
        {
            f >> v[++lg];
        }
        else
        {
            if(op == 2)
            {
                f >> x;
                w[x] = 1;
            }
            else
                if(op == 3)
                {
                    mini = 1 << 30;
                    for(j = 1; j <= lg; j++)
                        if(w[j] == 0 && v[j] < mini)
                            mini = v[j];
                    g << mini << '\n';
                }
        }
    }
    return 0;
}