#include<bits/stdc++.h>
#define D(...) fprintf(stderr,__VA_ARGS__)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
using LL=long long;
const int N=100005;
int T,m;
map<string,int>ID;
int idx;
string aID[N];
int getID(string s){
	if(ID.count(s))return ID[s];
	return aID[++idx]=s,ID[s]=idx;
}
struct node{
	int c;
	char p;
	int t,s;
}A[N];
int cmp(const pair<int,int>&lhs,const pair<int,int>&rhs){ // lhs better
	if(lhs.first!=rhs.first){
		return lhs.first>rhs.first;
	}else{
		return lhs.second<rhs.second;
	}
}
pair<int,int>Max(const pair<int,int>&lhs,const pair<int,int>&rhs){
	return cmp(lhs,rhs)?lhs:rhs;
}
pair<int,int>Min(const pair<int,int>&lhs,const pair<int,int>&rhs){
	return cmp(lhs,rhs)?rhs:lhs;
}
pair<int,int>operator+(const pair<int,int>&lhs,const pair<int,int>&rhs){
	return make_pair(lhs.first+rhs.first,lhs.second+rhs.second);
}
pair<int,int>operator-(const pair<int,int>&lhs,const pair<int,int>&rhs){
	return make_pair(lhs.first-rhs.first,lhs.second-rhs.second);
}
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	cin>>T;
	while(T--){
		ID.clear();
		idx=0;
		cin>>m;
		rep(i,1,m){
			static string s1,s2;
			cin>>s1>>A[i].p>>A[i].t>>s2;
			A[i].c=getID(s1);
			A[i].s=(s2[0]=='a');
		}
		vector<array<vector<pair<int,int> >,26> >v(idx+1);
		rep(i,1,m){
			v[A[i].c][A[i].p-'A'].emplace_back(A[i].t,A[i].s);
		}
		vector<pair<int,int> >w(idx+1),mxw(idx+1),mnw(idx+1);
		vector<int>maxT(idx+1,-1);
		vector<int>cnt(idx+1);
		int n0=0;
		rep(c,1,idx){
			rep(p,0,25){
				int flag=0,pd=0;
				int T=0;
				pair<int,int>now={0,0},mx={0,0},mn={1e9,1e9};
				for(auto&x:v[c][p]){
					if(x.second){
						if(!flag){
							flag=1;
							now.first=1;
							now.second=x.first+T;
						}else if(!pd){
							pd=1;
							mn=Min(mn,{1,x.first+T});
						}
					}else{
						if(!flag){
							mx=Max(mx,{1,x.first+T});
						}
						maxT[c]=max(maxT[c],x.first+T);
						T+=20;
					}
				}
				if(!pd){
					mn=Min(mn,{0,0});
				}
				w[c]=w[c]+now;
				mxw[c]=Max(mxw[c],mx-now);
				mnw[c]=Min(mnw[c],mn-now);
				cnt[c]+=flag;
			}
			n0+=cnt[c]>=1;
			mxw[c]=mxw[c]+w[c];
			mnw[c]=mnw[c]+w[c];
		}
		vector<int>ord(idx);
		rep(i,0,idx-1)ord[i]=i+1;
		sort(ord.begin(),ord.end(),[&](int lhs,int rhs){return cmp(w[lhs],w[rhs]);});
		vector<int>ans;
		vector<int>tag(idx+1);
		int pos=-1;
		rep(i,0,SZ(ord)-1){
			{
				int n1=n0;
				n1-=w[ord[i]].first>=1;
				n1+=mnw[ord[i]].first>=1;
				int C=min((n1+9)/10,35);
				pos=max(pos,C-1);
				if(C>=1&&i<C&&!cmp(mnw[ord[i]],w[ord[C]])){
					pos=max(pos,C);
				}
			}
			{
				int n1=n0;
				n1-=w[ord[i]].first>=1;
				n1+=mxw[ord[i]].first>=1;
				int C=min((n1+9)/10,35);
				if(C>=1&&!cmp(w[ord[C-1]],mxw[ord[i]])){
					tag[ord[i]]=1;
				}
			}
			if(cnt[ord[i]]==0){
				if(maxT[ord[i]]!=-1){
					int n1=n0+1;
					int C=min((n1+9)/10,35);
					if(C>=1&&!cmp(make_pair(1,maxT[ord[i]]),w[ord[C-1]])){
						pos=max(pos,C-1);
					}
				}
			}
			int C=min((n0+9)/10,35);
			if(i<C)tag[ord[i]]=1;
		}
		while(pos+1<SZ(ord)&&w[ord[pos]]==w[ord[pos+1]])++pos;
		rep(i,0,SZ(ord)-1){
			if(i<=pos||tag[ord[i]]){
				ans.push_back(ord[i]);
			}
		}
		printf("%d\n",SZ(ans));
		rep(i,0,SZ(ans)-1)printf("%s%c",aID[ans[i]].c_str(),i==SZ(ans)-1?'\n':' ');
	}
	return 0;
}