#include<bits/stdc++.h>
using namespace std;
long long a[1000005],k,num=0,sum=0;
void move1(){
	cin >> a[sum+1];
	sum++;
	if(sum!=1)
		while(a[sum-1]>a[sum])swap(a[sum],a[sum-1]);
	else num++;
}
void move2(){
	cout << a[num] << endl;
}
void move3(){
	num++;
}
int main(){
	int n,x;
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> x;
		if(x==1)move1();
		if(x==2)move2();
		if(x==3)move3();
	}
	return 0;
}