#include <fstream>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <string.h>
#include <queue>
#include <math.h>
#include <set>
#include <stack>

#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a<b)?b:a)

using namespace std;

//#define TEST
#ifdef TEST
ifstream fin("input.txt");
ofstream fout("output.txt");
#else
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
#endif // TEST

multiset<int> s;
int n;
int a[200000];
int m=0;

int main()
{
    fin>>n;

    for (int i=0; i<n; i++)
    {
        int x,y;
        fin>>x;
        if (x==1)
        {
            fin>>y;
            s.insert(y);
            a[m++]=y;
        } else if (x==2)
        {
            fin>>y;
            s.erase(s.lower_bound(a[y-1]));
        } else fout<<*(s.begin())<<'\n';
    }


    return 0;
}