#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define N 20005#define eps 1e-8using namespace std;typedef long long LL;struct str1{ int x,id; double y;}a[N];struct str2{ int kind,d;}num[N];int c[N],cc[N];double num2[N];char sa[10015];int m,tot,n;int lowbit(int x){ return x&(-x);}int sum(int x){ int re=0; while (x>0) { re+=c[x]; x-=lowbit(x); } return re;}int update(int x,int y){ while (x<=n) { c[x]+=y; x+=lowbit(x); }}bool cmp(str1 a,str1 b){ return a.y<b.y;}int find(int x){ int l=0,r=n,re=-1,mid; while (r>=l) { mid=(r+l)/2; if (sum(mid)<x) {re=mid;l=mid+1;}else r=mid-1; } return re;}void output(double s){ int i,len; sprintf(sa, "%lf", s); len = strlen(sa); for(i = len - 1; i >= 0; i--) { if(sa[i] == '.') break; if( sa[i] == '0' ) sa[i] = ' '; else break; } if(sa[ i ] == '.') sa[i] = ' '; if(sa[0] == ' ' ) printf("0n"); printf( "%sn",sa );}void doit(){ int x,y; char s[10]; scanf("%d",&m); for (int i=1;i<=m;i++) {scanf("%s%lf",s,&a[i].y); if (s[0]=='r') a[i].x=0;else a[i].x=1; a[i].id=i; } sort(a+1,a+m+1,cmp); a[0].y=a[1].y-1; int pp=0; for (int i=1;i<=m;i++) {if (fabs(a[i].y-a[i-1].y)>eps) {pp++;num2[pp]=a[i].y;}; num[a[i].id].kind=a[i].x; num[a[i].id].d=pp; } memset(c,0,sizeof(c)); memset(cc,0,sizeof(cc)); n=pp; tot=0; for (int i=1;i<=m;i++) { if (num[i].kind==1){ cc[num[i].d]++; tot++; update(num[i].d,1); } if (num[i].kind==0){if (cc[num[i].d]==0) {printf("Wrong!n"); continue;} cc[num[i].d]--; tot--; update(num[i].d,-1); } if (tot==0) printf("Empty!n"); else if (tot%2==1) { output(num2[find((tot+1)/2)+1]); } else output((num2[find(tot/2)+1]+num2[find(tot/2+1)+1])/2.0); }}int main(){ int cas; scanf("%d",&cas); while (cas--) doit(); return 0;}
