#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cstdlib>

#include<iostream>

#include<cstdlib>

using namespace std;

typedef long long ll;

const int N = ;

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

bool chk(int x){

    return ch[par[x]][]==x;

}

void pushup(int x){

    size[x]=size[ch[x][]]+size[ch[x][]]+cnt[x];//和线段树不同的是需要+上自身的cnt

}

void rotate(int x){

    int y=par[x],z=par[y],k=chk(x),w=ch[x][k^];

    ch[y][k]=w;par[w]=y;

    ch[z][chk(y)]=x;par[x]=z;

    ch[x][k^]=y;par[y]=x;

    pushup(y);pushup(x);

}

void splay(int x,int goal=){

    while(par[x]!=goal){

        int y=par[x],z=par[y];

        if(z!=goal){

            if(chk(x)==chk(y)) rotate(y);

            else rotate(x);

        }

        rotate(x);

    }

    if(!goal) root=x;

}

void insert(int x){

    int cur=root,p=;

    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][]=ch[cur][]=;

        par[cur]=p;val[cur]=x;

        cnt[cur]=size[cur]=;

    }

    splay(cur);

}

void find(int x){

    int cur=root;

    if(!cur) return;

    while(ch[cur][x>val[cur]]&&x!=val[cur]){

        cur=ch[cur][x>val[cur]];

    }

    splay(cur);

}

//从0开始

int kth(int k){

    k++;

    int cur=root;

    while(){

        if(ch[cur][]&&k<=size[ch[cur][]]){

            cur=ch[cur][];

        }else if(k>size[ch[cur][]]+cnt[cur]){

            k-=size[ch[cur][]]+cnt[cur];

            cur=ch[cur][];

        }else{

            return cur;

        }

    }

}

int rnk(int x){

    find(x);

    if(val[root]>=x) return size[ch[root][]];

    else return size[ch[root][]]+cnt[root];

}

int pre(int x){

    find(x);

    if(val[root]<x) return root;

    int cur=ch[root][];

    while(ch[cur][]) cur=ch[cur][];

    return cur;

}

int succ(int x) {

    find(x);

    if(val[root]>x) return root;

    int cur=ch[root][];

    while(ch[cur][]) cur=ch[cur][];

    return cur;

}

void remove(int x) {

    int last=pre(x),nxt=succ(x);

    splay(last);splay(nxt,last);

    int del=ch[nxt][];

    if(cnt[del]>){

        cnt[del]--;

        splay(del);

    }

    else ch[nxt][]=;

}

void init(){

    insert(-2e9);

    insert(2e9);

}

int n,op,x;

int main() {

    scanf("%d",&n);

    init();

    while(n--){

        scanf("%d%d",&op,&x);

        switch(op){

            case : insert(x); break;

            case : remove(x); break;

            case : printf("%d\n",rnk(x)); break;

            case : printf("%d\n",val[kth(x)]); break;

            case : printf("%d\n",val[pre(x)]); break;

            case : printf("%d\n",val[succ(x)]); break;

        }

    }

}