#include <fstream>
#include <vector>
#include <set>
#include <map>
#define intt long long
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
map <intt, intt >  fr;
intt n,x , sol = n, q, el=0;
intt v[200005];
map <intt, intt> :: iterator k;
map <intt, intt> :: iterator minim;
int main()
{
    f >> n;
    for(intt i = 1; i <= n; ++i)
    {
        f >> q;
        if(q == 1)
        {
            f >> x;
            fr[x] = 1;
            el++;
            v[el]=x;
            //g << "ADAUG "<< x <<'\n';
        }
        else if(q == 2)
        {
            f >> x;
            if(v[x] == 0) continue;
            k = fr.find(v[x]);
            fr.erase(k);
           // v.erase(k);
        }
        else if(q == 3)
        {
            /*k = minim = v.begin();
            for( ; k != v.end(); ++k)
            {
                if( (k -> second) < (minim -> second) ) minim = k ;
            }
            g << minim->second << '\n';*/
            g << fr.begin() -> first << '\n';
        }
    }
    g.close();
    return 0;
}