/*
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int MAX_N=100005;
int n,m,start,nrc;
vector <int> v[MAX_N];
int VIZ[MAX_N];


void BFS(int nod){

  queue < int > Q;

  fill(VIZ+1, VIZ + n + 1, -1);
  VIZ[nod]=0;
  Q.push(nod);

  while (!Q.empty()) {
    int node = Q.front();
    Q.pop();

    for (auto it : v[node]) {
        if (VIZ[it] == -1) {
            VIZ[it] = VIZ[node] + 1;
            Q.push(it);
        }
    }
  }

}

int main()
{
    fin>>n>>m>>start;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }

    BFS(start);

    for (int i = 1; i <= n; ++i)
        fout << VIZ[i] << " ";

    return 0;


}
*/

#include <iostream>
#include <fstream>
#include <set>
using namespace std;

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

const int maxn=200005;
int n,x,y,dim=0;
int val[maxn];
set < int > heap;

int main()
{


    fin>>n;
    for(int i=1; i<=n; i++)
    {

        fin>>x;
        if(x==1)
        {
            fin>>y;
            heap.insert(y);
            val[++dim]=y;
        }
        else if(x==2)
        {
            fin>>y;
            heap.erase(val[y]);
        }
        else
        {
            fout<<*heap.begin()<<endl;

        }
    }

}