#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <bitset>
#include <utility>

#define rep(i,a,b) for(int i=int(a); i<=int(b); ++i)
#define rev(i,b,a) for(int i=int(b); i>=int(a); --i)
#define rec(i,a,b,c) for(int i=int(a); i<=int(b); i+=int(c))
#define recv(i,a,b,c) for(int i=int(a); i>=int(b); i-=int(c))
#define mp(x,y) make_pair((x),(y))
#define pb(x) push_back(x)
#define all(c) c.begin(), c.end()
#define tr(container, it) for(auto it=(container).begin(); it != (container).end(); ++it)
#define sqr(x) ((x)*(x))
#define sz(a) int((a).size())
#define mod(a,n) ((a) < 0 ? ((n)+(a)) : ((a)%(n)))
#define mout(M,n,m) rep(i,0,(n)-1){ rep(j,0,(m)-1) cout << (M)[i][j] << " ";  cout << "\n"; }
using namespace std;

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;

vector<int> A;
unordered_map<int, int> I;
unordered_map<int, int> rI;

void hswap(int i, int j){

  int old_ord_i = rI[i];
  int old_ord_j = rI[j];

  rI[i] = rI[j];
  rI[j] = old_ord_i;

  I[old_ord_i] = j;
  I[old_ord_j] = i;

  swap(A[i], A[j]);
}

void heapify(int n, int i){

  while(i <= n){
    if(2*i+1 <= n){
      if(A[i] < A[2*i] && A[i] < A[2*i+1])
        break;
      if(A[2*i] < A[2*i+1]){
        hswap(i, 2*i);
        i = 2*i;
      }
      else{
        hswap(i, 2*i+1);
        i = 2*i+1;
      }
    }
    else if(2*i <= n){
      if(A[i] < A[2*i])
        break;
      hswap(i, 2*i);
      i = 2*i;
    }
    else  // we are at a leaf.
      break;
  }
}

void build_heap(int n){
  for(int i=n/2; i>=1; --i){
    heapify(n,i);
  }
}


int main(){

  /*
  int n;
  cin >> n;
  A.resize(n+1,0);
  for(int i=1; i<=n; ++i){
    int val;
    cin >> A[i];
  }

  build_heap(n);

  for(int i=1; i<=n; ++i){
    cout << A[i] << " ";
  }
  cout << "\n";
  */

  freopen("heapuri.in", "r", stdin);
  freopen("heapuri.out", "w", stdout);

  int n, N;
  cin >> N;
  n = 0;
  A.push_back(0);
  bool inserted = false;
  while(N--){
    int op, x;
    cin >> op;
    if(op == 1){
      n++;
      int val;
      cin >> val;
      A.push_back(val);
      inserted = true;
      I[n] = n;
      rI[n] = n;
    }
    else if(op == 2){
      if(inserted){
        build_heap(n);
        inserted = false;
      }
      cin >> x;
      int pos = I[x];
      hswap(pos, n);
      n--;
      heapify(n, pos);
    }
    else if(op == 3){
      if(inserted){
        build_heap(n);
        inserted = false;
      }
      cout << A[1] << endl;
    }
    /*
    cout << "heap: ";
    for(int i=1; i<=n; ++i)
      cout << A[i] << " ";
    cout << "\n";
    cout << "I:\n";
    tr(I, it){
      cout << it->first << ": " << it->second << endl;
    }
    */
  }

  return 0;
}