#include<iostream>  
#include<algorithm>  
#include<cstring>  
#include<string>  
#include<cstdio>
#include<queue>
#include<set>
using namespace std;  
#define T 1000000+50  
#define inf 0x3f3f3f3f  typedef long long ll;struct node1
{int v;node1(int _1):v(_1){}bool operator<(const node1& b)const{return v>b.v;}
};struct node2
{int v;node2(int _1):v(_1){}bool operator<(const node2& b)const{return v<b.v;}
};int a[T];
set<node1> se1;
set<node2> se2;
set<node1>::iterator it;
set<node2>::iterator itt;int main()
{
#ifdef zscfreopen("input.txt","r",stdin);
#endifint n,m,i,j,k,head,tail,size;while(~scanf("%d",&n)){se1.clear();se2.clear();head = tail = 0;while(n--){int u,v;scanf("%d",&u);if(u==1){scanf("%d",&v);a[tail++] = v;k = tail - head; if(se1.size()==0&&se2.size()==0){se2.insert(v);}else if(se1.size()<k/2){itt = se2.begin();int tmp = (*itt).v; if(tmp<v)se2.erase(itt),se2.insert(node2(v)),se1.insert(node1(tmp));else se1.insert(node1(v));}else{it = se1.begin();int tmp = (*it).v; if(tmp>v)se1.erase(it),se1.insert(node1(v)),se2.insert(node2(tmp));else se2.insert(node2(v));}}else if(u==2){it = se1.lower_bound(a[head++]);if((*it).v==a[head-1]&&it!=se1.end()){se1.erase(it);size = (se1.size()+se2.size())/2;while(se1.size()<size){itt = se2.begin();se1.insert(node1((*itt).v));se2.erase(itt);}}else{itt = se2.lower_bound(a[head-1]);se2.erase(itt);size = (se1.size()+se2.size())/2;while(se1.size()>size){it = se1.begin();se2.insert(node2((*it).v));se1.erase(it);}}}else {itt = se2.begin();printf("%d\n",(*itt).v);}}}return 0;
}