/* ***********************************************
MYID    : Chen Fan
LANG    : G++
PROG    : Splay Tree
************************************************ */#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>using namespace std;#define MAXN 100000int sons[MAXN][2];
int father[MAXN],size[MAXN],data[MAXN];
int spt=0,spttail=0;void rotate(int x,int w) //rotate(node,0/1)
{int y=father[x];sons[y][1-w]=sons[x][w];if (sons[x][w]) father[sons[x][w]]=y;father[x]=father[y];if (father[y])if (y==sons[father[y]][0]) sons[father[y]][0]=x;else sons[father[y]][1]=x;sons[x][w]=y;father[y]=x;size[x]=size[y];size[y]=size[sons[y][0]]+size[sons[y][1]]+1;
}void splay(int x,int y) //splay(node,position)
{if (!x) return ;while(father[x]!=y){if (father[father[x]]==y)if (x==sons[father[x]][0]) rotate(x,1);else rotate(x,0);else if (father[x]==sons[father[father[x]]][0])if (x==sons[father[x]][0]){rotate(father[x],1);rotate(x,1);} else {rotate(x,0);rotate(x,1);}else if (x==sons[father[x]][1]){rotate(father[x],0);rotate(x,0);} else {rotate(x,1);rotate(x,0);}}if (!y) spt=x;
}void search(int x,int w)
{while(data[x]!=w){if (w<data[x]){if (sons[x][0]) x=sons[x][0];else break;} else if (w>data[x]){if (sons[x][1]) x=sons[x][1];else break;}}splay(x,0);
}void insert(int w) //insert(value)
{spttail++;data[spttail]=w;size[spttail]=1;sons[spttail][0]=0;sons[spttail][1]=0;if (!spt){father[spttail]=0;spt=spttail;} else {int x=spt;while(1){size[x]++;if (w<data[x])if (sons[x][0]) x=sons[x][0];else break;else if (sons[x][1]) x=sons[x][1];else break;}father[spttail]=x;if (w<data[x]) sons[x][0]=spttail;else sons[x][1]=spttail;splay(spttail,0);}
}void select(int x,int v) //select(root,k)
{while(v!=size[sons[x][0]]+1){if (v<=size[sons[x][0]]) x=sons[x][0];else {v-=size[sons[x][0]]+1;x=sons[x][1];}}splay(x,0);
}int succ(int t)
{t=sons[t][1];while(sons[t][0]) t=sons[t][0];splay(t,0);return t;
}void del(int x) //del(number)
{splay(x,0);int y=sons[x][0];while(!sons[y][1]){y=sons[y][1];}int z=sons[x][1];while(!sons[z][0]){z=sons[z][0];}if (y+z==0){spt=0;spttail=0;return ;}if (y){splay(y,0);size[y]--;}if (z){splay(z,y);sons[z][0]=0;size[z]--;}
}int rank(int v) //rank(value)
{search(spt,v);return size[sons[spt][0]]+1;
}int main()
{memset(father,0,sizeof(father));memset(size,0,sizeof(size));memset(sons,0,sizeof(sons));memset(data,0,sizeof(data));spt=0;spttail=0;return 0;
}