#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.first << ' ' << p.second << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000000007
#define zeros(x) x&(x-1)^x
#define fi first
#define se second
#define NMAX 200005
const long double PI = acos(-1);

int n, nr;
int l, p[NMAX];

struct nod {
  int val, pos;
}h[NMAX];

void promoveaza(int i) {
  while (i != 1 && h[i].val < h[i/2].val) {
    swap(p[h[i].pos], p[h[i/2].pos]);
    swap(h[i], h[i/2]);

    i = i / 2;
  }
}

void insereaza(int x, int pos) {
  l++;
  h[l].val = x;
  h[l].pos = pos;
  p[pos] = l;

  promoveaza(l);
}

void sterge(int pos) {
  swap(p[h[pos].pos], p[h[l].pos]);
  swap(h[pos], h[l]);
  l--;

  if (pos > 1 && h[pos/2].val > h[pos].val) {
    promoveaza(pos);
  } else {
    while ((pos * 2 <= l && h[pos*2].val < h[pos].val) ||
      (pos * 2 + 1 <= l && h[pos*2+1].val < h[pos].val)) {
      if (pos * 2 + 1 > l || h[pos*2].val < h[pos*2+1].val) {
        swap(p[h[pos].pos], p[h[pos*2].pos]);
        swap(h[pos], h[pos*2]);
        pos = pos * 2;
      } else {
        swap(p[h[pos].pos], p[h[pos*2+1].pos]);
        swap(h[pos], h[pos*2+1]);  
        pos = pos * 2 + 1;
      }
    }
  }
}

int main(){
  ios::sync_with_stdio(false);
 
  freopen("heapuri.in", "r", stdin);
  freopen("heapuri.out", "w", stdout);

  cin >> n;
  for (int i=1;i<=n;i++) {
    int x, t;
    cin >> t;
    if (t == 1) {
      cin >> x;
      nr++;
      insereaza(x, nr);
      for (int j=1;j<=l;j++) {
        cerr << h[j].val << ' ';
      }
      cerr << '\n';
    } if (t == 2) {
      cin >> x;
      sterge(p[x]);
      for (int j=1;j<=l;j++) {
        cerr << h[j].val << ' ';
      }
      cerr << '\n';
    } else if (t == 3) {
      cout << h[1].val << '\n';
    }
  } 


  return 0;
}