#include<cstdio>
#include<stdlib.h>
#include<cmath>
#define in inline
using namespace std;
const int N=1e5+7,INF=1e8;
int n;
struct Node{
    int l,r,key,val,cnt,size;
}tr[N];
int root,idx;
in void pushup(int p){
    tr[p].size=tr[tr[p].l].size+tr[tr[p].r].size+tr[p].cnt;
    return ;
}
in int get_node(int key){
    tr[++idx].key=key;
    tr[idx].val=rand();
    tr[idx].cnt=tr[idx].size=1;
    return idx;
}
in void build(){
    get_node(-INF),get_node(INF);
    root=1,tr[1].r=2;
    pushup(root);
    return ;
}
in void zig(int &p){
    int q=tr[p].l;
    tr[p].l=tr[q].r;
    tr[q].r=p;
    p=q;
    pushup(tr[p].r);
    pushup(p);
    return ;
}
in void zag(int &p){
    int q=tr[p].r;
    tr[p].r=tr[q].l;
    tr[q].l=p;
    p=q;
    pushup(tr[p].l);
    pushup(p);
    return ;
}
in void insert(int &p,int key){
    if(!p){
        p=get_node(key);
    }
    else if(tr[p].key==key){
        tr[p].cnt++;
    }
    else if(tr[p].key>key){
        insert(tr[p].l,key);
        if(tr[tr[p].l].val>tr[p].val){
            zig(p);
        }
    }
    else{
        insert(tr[p].r,key);
        if(tr[tr[p].r].val>tr[p].val){
            zag(p);
        }
    }
    pushup(p);
    return ;
}
in void re(int &p,int key){
    if(!p){
        return ;
    }
    if(tr[p].key==key){
        if(tr[p].cnt>1){
            tr[p].cnt--;
        }
        else if(tr[p].l||tr[p].r){
            if(!tr[p].r||tr[tr[p].l].val>tr[tr[p].r].val){
                zig(p);
                re(tr[p].r,key);
            }
            else{
                zag(p);
                re(tr[p].l,key);
            }
        }
        else{
            p=0;
        }
    }
    else if(tr[p].key>key){
        re(tr[p].l,key);
    }
    else{
        re(tr[p].r,key);
    }
    pushup(p);
    return ;
}
in int grbk(int p,int key){
    if(!p){
        return 0;
    }
    if(tr[p].key==key){
        return tr[tr[p].l].size+1;
    }
    if(tr[p].key>key){
        return grbk(tr[p].l,key);
    }
    return tr[tr[p].l].size+tr[p].cnt+grbk(tr[p].r,key);
}
in int gkbr(int p,int rank){
    if(!p){
        return INF;
    }
    if(tr[tr[p].l].size>=rank){
        return gkbr(tr[p].l,rank);
    }
    if(tr[tr[p].l].size+tr[p].size>=rank){
        return tr[p].key;
    }
    return gkbr(tr[p].r,rank-tr[tr[p].l].size-tr[p].cnt);
}
in int gp(int p,int key){
    if(!p){
        return -INF;
    }
    if(tr[p].key>=key){
        return gp(tr[p].l,key);
    }
    return max(tr[p].key,gp(tr[p].r,key));
}
in int gn(int p,int key){
    if(!p){
        return INF;
    }
    if(tr[p].key<=key){
        return gp(tr[p].r,key);
    }
    return min(tr[p].key,gn(tr[p].l,key));
}
signed main(){
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        int opt,x;
        scanf("%d%d",&opt,&x);
        if(opt==1){
            insert(root,x);
        }
        else if(opt==2){
            re(root,x);
        }
        else if(opt==3){
            printf("%d\n",grbk(root,x)-1);
        }
        else if(opt==4){
            printf("%d\n",gkbr(root,x+1));
        }
        else if(opt==5){ 
            printf("%d\n",gp(root,x));
        }
        else{
            printf("%d\n",gn(root,x));
        }
    }
    return 0;
}