#include<iostream>
#include<cstdio>

#define N 10000000
using namespace std;

int ch[N][2],cnt[N],val[N],size[N],par[N],root,ncnt;

int chk(int x){
    return ch[par[x]][1]==x;
}

void pushup(int x){
    size[x]=size[ch[x][0]]+size[ch[x][1]]+cnt[x];
}

void rotate(int x){
    int y=par[x],z=par[y],k=chk(x),w=ch[x][k^1];
    ch[y][k]=w,par[w]=y;//父亲 
    ch[z][chk(y)]=x,par[x]=z;//祖父 
    ch[x][k^1]=y,par[y]=x;//自己 
    pushup(y),pushup(x);
}

void splay(int x,int goal=0){
    while(par[x]!=goal){
        int y=par[x],z=par[y];
        if(z!=goal){
            if(chk(y)==chk(x)) rotate(y);
            else rotate(x);
        }
        rotate(x);
    }
    if(!goal) root=x;
}

void find(int x){
//    if(!root) return;
    int cur=root;
    while(ch[cur][x>val[cur]]&&x!=val[cur]){
        cur=ch[cur][x>val[cur]];
    }
    splay(cur);
}

void insert(int x){
    int cur=root,p=0;
    while(cur&&val[cur]!=x){
        p=cur;
        cur=ch[cur][x>val[cur]];
    }
    if(cur){
        cnt[cur]++;
    }else{
        cur=++ncnt;
        if(p) ch[p][x>val[p]]=cur;
        ch[cur][0]=ch[cur][1]=0;
        val[cur]=x,par[cur]=p;
        cnt[cur]=size[cur]=1;
    }
    splay(cur);
}

int kth(int k){
    int cur=root;
    while(1){
        if(ch[cur][0]&&k<=size[ch[cur][0]]){
            cur=ch[cur][0];
        }else if(k>size[ch[cur][0]]+cnt[cur]){
            k-=size[ch[cur][0]]+cnt[cur];
            cur=ch[cur][1];
        }else return cur;
    }
}

int pre(int x){
    find(x);
    if(val[root]<x) return root;
    int cur=ch[root][0];
    while(ch[cur][1]){
        cur=ch[cur][1];
    }
    return cur;
}
int succ(int x){
    find(x);
    if(val[root]>x) return root;
    int cur=ch[root][1];
    while(ch[cur][0]){
        cur=ch[cur][0];
    }
    return cur;
}

void remove(int x){
    int last=pre(x),next=succ(x);
    splay(last);splay(next,last);
    int del=ch[next][0];
    if(cnt[del]>1){
        cnt[del]--;
        splay(del);
    }else ch[next][0]=0;
}

int n;

int main()
{
    scanf("%d",&n);
    insert(0x3f3f3f3f);
    insert(0xcfcfcfcf);
    for(int opt,x,i=1;i<=n;i++){
        scanf("%d%d",&opt,&x);
        if(opt==1) insert(x);
        if(opt==2) remove(x);
        if(opt==3) find(x),printf("%d\n",size[ch[root][0]]);
        if(opt==4) printf("%d\n",val[kth(x+1)]);
        if(opt==5) printf("%d\n",val[pre(x)]);
        if(opt==6) printf("%d\n",val[succ(x)]);
    }
    
    return 0;
}