#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#include <climits>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define LL long long
#define ULL unsigned long long
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

template <class T>
void ReadNo(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		(ch == '-') && (_sign = -1);
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
}

int N, nr_elements;
vector <int> nth_insertion(1);
deque <pair <int, int> > heap(1);

void UpdateElementUp(int pos) {
	int parent;
	parent = pos / 2;
	while (parent) {
		if (heap[parent].first > heap[pos].first) {
			swap(nth_insertion[heap[parent].second], nth_insertion[heap[pos].second]);
			swap(heap[parent], heap[pos]);
		}
		else {
			break;
		}
		pos = parent;
		parent = pos / 2;
	}
}

void UpdateElementDown(int pos, int limit) {
	int son;
	son = pos * 2;
	while (son <= limit && pos <= son) {
		if (son + 1 <= limit && heap[son + 1].first < heap[son].first) {
			++son;
		}
		if (heap[son].first < heap[pos].first) {
			swap(nth_insertion[heap[pos].second], nth_insertion[heap[son].second]);
			swap(heap[pos], heap[son]);
		}
		else {
			break;
		}
		pos = son;
		son *= 2;
	}
}


int main(){
	string file_input = "heapuri";
#ifdef INFOARENA
	freopen((file_input + ".in").c_str(), "r", stdin);
	freopen((file_input + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
	freopen("input.cpp", "r", stdin);
#endif
#endif
	
	int i, t, x;
	ReadNo(N);
	
	for (i = 0; i < N; ++i) {
		ReadNo(t);
		if (t == 1) {
			ReadNo(x);
			heap.pb(mp(x, nth_insertion.size()));
			nth_insertion.pb(heap.size() - 1);
			UpdateElementUp(heap.size() - 1);
		}
		else if (t == 2) {
			ReadNo(x);
			int last_el = heap[heap.size() - 1].second;
			swap(heap[nth_insertion[x]], heap[heap.size() - 1]);
			nth_insertion[last_el] = nth_insertion[x];
			heap.pop_back();
			UpdateElementDown(nth_insertion[last_el], heap.size() - 1);
		}
		else {
			printf("%d\n", heap[1].first);
		}
	}
	
	return 0;
}