#include <iostream>
#include <fstream>
#include <set>
#define ll long long
#define nmax 200005
using namespace std;

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

multiset<ll> H;
ll v[nmax], x, t=0;
int n, tip;

int main()
{
    in>>n;
    for (int i=1; i<=n; ++i)
     {
         in>>tip;
          switch (tip)
           {
               case 1:
                in>>x;
                H.insert(x);
                v[++t] = x;
                break;
               case 2:
                in>>x;
                H.erase( H.find( v[x] ) );
                break;
               case 3:
                out<<*H.begin()<<'\n';
                break;
           }
     }

return 0;
}