#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <list>
#include <bitset>
#include <ctime>
#include <cassert>
#include <iomanip>

using namespace std;


const string file = "heapuri";
const string inputF = file + ".in";
const string outputF = file + ".out";

const double epsilon = 1e-7;
#define LL long long
#define ULL unsigned long long 
#define MOD1 666013
#define MOD2 666019
#define MOD3 1999999973
#define base 73

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> ii;
typedef pair<long long, long long> ll;
typedef vector<ii> vii;
typedef vector<ll> vll;

#define all(V) V.begin(), V.end()
#define allr(V) V.rbegin(), V.rend()
#define for_c_it(container, it) for (auto it : container)
#define present(container, element) (container.find(element) != container.end()) 
#define sz(a) int((a).size()) 
#define pb push_back 
#define mp make_pair
#define zeroes(x) ((x ^ (x - 1)) & x)
#define maxn 200001

vi V(maxn), heap(maxn), place(maxn);
int M, N;

void insert(int pos);
void remove(int pos);

int main() {
#ifndef INFOARENA
	freopen("input.txt", "r", stdin);
#else 
	freopen(inputF.c_str(), "r", stdin);
	freopen(outputF.c_str(), "w", stdout);
#endif
	int c, x;
	heap.resize(200001);
	
	scanf("%d", &M);
	while(M--) {
		scanf("%d", &c);
		if (c == 1) {
			++V[0];
			scanf("%d", &V[V[0]]);
			insert(V[0]);

		}
		else if(c == 2) {
			scanf("%d", &x);
			remove(x);

		}
		else {
			printf("%d\n", V[heap[1]]);
		}
	}

	return 0;
}

void insert(int pos) {
	++N;
	heap[N] = pos;
	place[pos] = N;
	
	int iam, up;
	iam = N;
	up = iam >> 1;
	while (up > 0 && V[heap[up]] > V[pos]) {
		heap[iam] = heap[up];
		place[heap[iam]] = iam;
		iam = up;
		up >>= 1;
	}
	
	heap[iam] = pos;
	place[pos] = iam;	
}

void remove(int pos) {
	int ch = heap[N];
	swap(heap[N], heap[place[pos]]);
	--N;

	int iam, down;
	iam = place[pos];
	down = iam << 1;
	pos = ch;
	while (down <= N) {
		if (down < N && V[heap[down + 1]] < V[heap[down]]) {
			++down;
		}
		if (V[heap[down]] > V[pos]) {
			break;
		}
		heap[iam] = heap[down];
		place[heap[iam]] = iam;
		iam = down;
		down = down << 1;
	}
	heap[iam] = pos;
	place[pos] = iam;
}