#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include<map>
#include<vector>
 #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;
map<string,int> tname;
int pos,m,sum_team;
struct submission
{
    int num;
    string name;
    int time,pro;
    bool zt;
}sub[100010];

bool cmp(submission a,submission b)
{
	if(a.name!=b.name)
		return a.name<b.name;
	if(a.pro!=b.pro)
		return a.pro<b.pro;
	if(a.time!=b.time)
		return a.time<b.time;
	if(a.num!=b.num)
		return a.num<b.num;
}

struct problem
{
    int num_sub=0,sum_time=0,less_time=0;
    bool flag=false;
    int index;
};

struct team
{
    string name;
    int guo,fa;
    // int start,end;
    vector<problem> pro;
}tea[100010];

bool cmp1(pair<pair<int,int>,string> a,pair<pair<int,int>,string> b)
{
    if(a.first.first!=b.first.first)
        return a.first.first>b.first.first;
    return a.first.second<b.first.second;
}

void solve()
{
    map<string,int> ans;
  	int m;
  	cin>>m;
    tname.clear();
    sum_team=0;
	for(int i=1;i<=m;i++)
	{
		sub[i].num=i;
		string c,p,s;
		int t;
		cin>>c>>p>>t>>s;
		sub[i].name=c;
		sub[i].pro=p[0]-'A';
		sub[i].time=t;
		if(s=="accepted")
			sub[i].zt=true;
		else
			sub[i].zt=false;
	}
	sort(sub+1,sub+1+m,cmp);
    pos=1;
	while(pos<=m)
	{
		string name=sub[pos].name; //当前队名
        tname[name]=++sum_team;
		bool flag=false; //是否过题
		int guo=0,fa=0; //过题数和罚时
        tea[sum_team].name=name;
        tea[sum_team].pro.clear();
		while(sub[pos].name==name&&pos<=m)
		{
            problem x;
            x.index=sub[pos].pro;
            x.less_time=sub[pos].time;
			int pro=sub[pos].pro; //当前题目
			bool flag1=false;  //是否过题
			int ti=0; //罚时
			// cout<<name<<" "<<pro<<" "<<mint<<"\n";
			while(sub[pos].pro==pro&&sub[pos].name==name&&pos<=m)
			{
                if(!flag1)
                    x.num_sub++;
				if(sub[pos].zt&&flag1==false)
				{
					flag1=true;
					ti+=sub[pos].time;
				}
				else if(!flag1)
					ti+=20;
				pos++;
			}
            x.flag=flag1;
			if(flag1)
			{
				flag=true;
                x.sum_time=ti;
				guo++;
				fa+=ti;		
			}
            tea[sum_team].pro.push_back(x);
		}
        tea[sum_team].guo=guo;
        tea[sum_team].fa=fa;
	}
    for(int i=1;i<=m;i++)
    {
        pos=tname[sub[i].name];
        string name=sub[i].name;
        int index=sub[i].pro;
        int shun=sub[i].num;
        int l=i,r=i;
        while(l>0&&sub[l].name==name&&sub[l].pro==index)
            l--;
        while(r<=m&&sub[r].name==name&&sub[r].pro==index)
            r++;
        l++;
        r--;
        bool flag5=false;
        int xinti=0;
        for(int j=l;j<=r;j++)
        {
            bool zt=sub[j].zt;
            if(sub[j].num==shun)
                zt=1-zt;
            if(zt&&flag5==false)
            {
                flag5=true;
                xinti+=sub[j].time;
            }
            else if(!flag5)
            {
                xinti+=20;
            }
        }
        int xinguo=0,xinfa=0;
        for(auto c:tea[pos].pro)
        {
            if(c.index==index)
            {
                if(flag5)
                {
                    xinguo++;
                    xinfa+=xinti;
                }
            }
            else
            {
                if(c.flag)
                {
                    xinguo++;
                    xinfa+=c.sum_time;
                }
            }
        }
        // cout<<xinguo<<"\n";
        vector<pair<pair<int,int>,string>> all;
        for(int j=1;j<=sum_team;j++)
        {
            if(j==pos&&xinguo>0)
            {
                // cout<<i<<" 1 "<<xinguo<<" "<<xinfa<<" "<<name<<"\n";
                all.push_back({{xinguo,xinfa},name});
            }
            else if(j!=pos&&tea[j].guo>0)
            {
                // cout<<i<<" 2 "<<tea[j].guo<<" "<<tea[j].fa<<" "<<tea[j].name<<"\n";
                all.push_back({{tea[j].guo,tea[j].fa},tea[j].name});
            }
        }
        sort(all.begin(),all.end(),cmp1);
        int ssum=all.size();
        // cout<<ssum<<"\n";
        int gold=min(35,(ssum+9)/10);
        int stguo=all[gold-1].first.first,stfa=all[gold-1].first.second;
        for(auto c:all)
        {
            if(c.first.first>stguo||c.first.first==stguo&&c.first.second<=stfa)
                ans[c.second]=1;
        }
    }
    {
        vector<pair<pair<int,int>,string>> all;
        for(int j=1;j<=sum_team;j++) 
            if(tea[j].guo>0)
                all.push_back({{tea[j].guo,tea[j].fa},tea[j].name});
        sort(all.begin(),all.end(),cmp1);
        int ssum=all.size();
        // cout<<ssum<<"\n";
        int gold=min(35,(ssum+9)/10);
        int stguo=all[gold-1].first.first,stfa=all[gold-1].first.second;
        for(auto c:all)
        {
            if(c.first.first>stguo||c.first.first==stguo&&c.first.second<=stfa)
                ans[c.second]=1;
        }
    }
    cout<<ans.size()<<"\n";
    for(auto s:ans)
    {
        cout<<s.first<<" ";
    }
    cout<<"\n";
}
int main()
{
    IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
    int t;
    t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}