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

using namespace std;

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

set<int> v;

int main()
{
    int tip, x, n, k = 1, pos[200005];
    fin>>n;
    for(int i = 0; i < n; i++)
    {
        fin>>tip;
        switch (tip)
        {
            case 1:
            {
                fin>>x;
                v.insert(x);
                pos[k++] = x;
                break;
            }
            case 2:
            {
                fin>>x;
                v.erase(pos[x]);
                break;
            }
            case 3:
            {
                fout<<*v.begin()<<'\n';
                break;
            }
        }
    }
    return 0;
}