#include <stdio.h>
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < (int)(n); i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;

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

int main(void) {
  // freopen("heapuri.in", "r", stdin);
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  int n, q, x;
  fin >> n;
  vi v;
  priority_queue<int, vector<int>, greater<int> > pq, dels;
  rep(i, n) {
    fin >> q;
    switch(q) {
      case 1:
        fin >> x;
        v.push_back(x);
        pq.push(x);
        break;
      case 2:
        fin >> x;
        --x;
        dels.push(v[x]);
        break;
      case 3:
        while(!pq.empty()) {
          int x = pq.top();
          if (dels.empty() || dels.top() != x) {
            fout << x << '\n';
            break;
          } else {
            dels.pop();
            pq.pop();
          }
        }
        break;
    }
  }

  return 0;
}