#include<bits/stdc++.h>
using namespace std;
#define N 100001
typedef int type;
struct node
{ 
    int l,r;
    type a,sum,val,size,key;
    
}tr[N];
int n,root=1,idx=0;
int newnode(type v)
{
    tr[++idx].val=v;
    tr[idx].size=1;
    tr[idx].key=rand();
    return idx;
}
void pushup(int p){tr[p].size=tr[tr[p].l].size+tr[tr[p].r].size+1;}
void split(int p,type v,int &x,int &y)
{
    if(!p)
    {
        x=y=0;
        pushup(p);
    }
    else if(tr[p].val<=v)
    {
        x=p;
        split(tr[x].r,v,tr[x].r,y);
        pushup(p);
    }
    else
    {
        y=p;
        split(tr[y].l,v,x,tr[y].l);
        pushup(p);
    }
}
int merge(int x,int y)
{
    if(!x||!y) return x+y;
    if(tr[x].key<tr[y].key)
    {
        tr[x].r=merge(tr[x].r,y);
        pushup(x);
        return x;
    }
    else
    {
        tr[y].l=merge(x,tr[y].l);
        pushup(y);
        return y;
    }
}
void insert(type v)
{
    int x,y,z;
    split(root,v,x,y);
    z=newnode(v);
    root=merge(merge(x,z),y);
}
void del(type v)
{
    int x,y,z;
    split(root,v,x,z);
    split(x,v-1,x,y);
    if(y) y=merge(tr[y].l,tr[y].r);
    else
    root=merge(merge(x,y),z);
}
int get_v(int p,type v)
{
    if(v<=tr[tr[p].l].size) return get_v(tr[p].l,v);
    if(v==tr[tr[p].l].size+1) return p;
    return get_v(tr[p].r,v-tr[tr[p].l].size-1);
}
type get_pre(type v)
{
    type ans;
    int x,y;
    split(root,v-1,x,y);
    int p=get_v(x,tr[x].size);
    ans=tr[p].val;
    root=merge(x,y);
    return ans;
}
type get_suc(type v)
{
    type ans;
    int x,y;
    split(root,v,x,y);
    int p=get_v(y,1);
    ans=tr[p].val;
    root=merge(x,y);
    return ans;
}
type get_var(int k)
{
    return tr[get_v(root,k)].val;
}
type get_rank(type v)
{
    type ans;
    int x,y;
    split(root,v-1,x,y);
    ans=tr[x].size+1;
    root=merge(x,y);
    return ans;
}
int main()
{
    srand((unsigned)time(NULL));
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin>>t;
    while(t--)
    {
        int op;
        type v;
        cin>>op>>v;
        switch(op)
        {
            case 1:
            insert(v);
            break;
            case 2:
            del(v);
            break;
            case 3:
            cout<<get_rank(v)<<'\n';
            break;
            case 4:
            cout<<get_var(v)<<'\n';
            break;
            case 5:
            cout<<get_pre(v)<<'\n';
            break;
            case 6:
            cout<<get_suc(v)<<'\n';
            break;
        }
    }
    return 0;
}