#include <bits/stdc++.h>
#define MAXN 100010
#define INF 1000000007
using namespace std;
#define For(i, a, b) for(int i = (a);i <= (b);i++) 
#define Rof(i, a, b) for(int i = (a);i >= (b);i--)
#define LL long long
struct Score{
    int n,t;
};
void PRINTSCORE(Score x){
    cout<<x.n<<","<<x.t<<"\n";
}
bool operator<(Score x,Score y){
    if (x.n!=y.n) return x.n<y.n;
    return x.t>y.t;
}
bool operator>=(Score x,Score y){
    return !(x<y);
}
bool operator==(Score x,Score y){
    return (x.n==y.n&&x.t==y.t);
}
bool operator!=(Score x,Score y){
    return !(x==y);
}
Score operator+(Score x,Score y){
    x.n+=y.n;
    x.t+=y.t;
    return x;
}
Score operator-(Score x,Score y){
    x.n-=y.n;
    x.t-=y.t;
    return x;
}
int tmp[MAXN];
map<string,int> mp;
string name[MAXN];
typedef pair<int,bool> pib;
vector<pib> sub[MAXN][30];
Score score[MAXN][30];
Score totscore[MAXN];
set<int> li;
bool cmp(int x,int y){return totscore[y]<totscore[x];}
Score calscore(const vector<pib>& a){
    int t=0;
    bool f=0;
    for(pib x:a){
        if (x.second){
            f=1;
            t+=x.first;
            break;
        }else{
            t+=20;
        }
    }
    if (f) return {1,t};
    else return {0,0};
}   
void Main(){
    li.clear();
    mp.clear();
    int m;cin>>m;
    For(i,1,m) For(j,0,26) sub[i][j].clear();
    For(i,1,m){
        string s;char c;
        int t;string sta;
        cin>>s>>c>>t>>sta;
        if (mp.count(s)==0){
            int mpsz=mp.size()+1;
            mp[s]=mpsz;
            name[mpsz]=s;
        }
        int id=mp[s];
        sub[id][c-'A'].push_back({t,sta=="accepted"});
    }
    int n=mp.size();
    int n1=0;
    For(i,1,n){
        tmp[i]=i;
        totscore[i]={0,0};
        For(j,0,25){
            score[i][j]=calscore(sub[i][j]);
            totscore[i]=totscore[i]+score[i][j];
        }
        n1+=totscore[i].n>0;
    }
    totscore[0]={1000000000,0};
    sort(tmp+1,tmp+n+1,cmp); 
    int gold=min((int)ceil(n1*0.1),35);
    // printf("n1=%d gold=%d\n",n1,gold);
    int nol=-1,nor=-1;
    // PRINTSCORE(totscore[tmp[gold]]);
    For(iii,1,n){
        int x=tmp[iii];
        // PRINTSCORE(totscore[x]);
        if (totscore[x]>=totscore[tmp[gold]]) li.insert(x);
        else{
            if (nol==-1) nol=iii,nor=iii;
            else{
                if (totscore[x]==totscore[tmp[nol]]) nor=iii;
            }
        }
    }
    bool haveadd=0;
    if (nol<=0||totscore[tmp[nol]]==Score{0,0}) haveadd=1;
    // For(i,1,n) cout<<tmp[i]<<" ";
    For(iii,1,n){
        int x=tmp[iii];
        if (totscore[x]>=totscore[tmp[gold]]){ // 本身可以金牌
            if (haveadd) continue;
            Score maxminus={0,0};
            For(j,0,25){
                if (score[x][j]==Score{0,0}) continue;
                vector<pib> b=sub[x][j];
                for (pib &x:b){
                    if (x.second==1){
                        x.second=0;
                        break;
                    }
                }
                Score now=calscore(b);
                // printf("maxminus={%d,%d},minus={%d,%d}\n",maxminus.n,maxminus.t,(score[x][j]-now).n,(score[x][j]-now).t);
                maxminus=max(score[x][j]-now,maxminus);
                // printf("maxminus={%d,%d},minus={%d,%d}\n",maxminus.n,maxminus.t,(score[x][j]-now).n,(score[x][j]-now).t);
            }
            Score now=totscore[x]-maxminus;
            int gold2=gold;
            if (totscore[x]!=Score{0,0}&&now==Score{0,0}){
                gold2=min((int)ceil((n1-1)*0.1),35);
            }
            if (totscore[tmp[nol]]>=now&&(nol-1<=gold2)){
                haveadd=1;
                For(i,nol,nor) li.insert(tmp[i]);
            }
            /* if () */
        }else{
            Score maxplus={0,0};
            Score minplus={INF,INF};
            For(j,0,25){
                if (sub[x][j].empty()) continue;
                vector<pib> b=sub[x][j];
                b[0].second=1;
                Score now=calscore(b);
                maxplus=max(now-score[x][j],maxplus);
                b[0].second=0;
                b[b.size()-1].second=1;
                now=calscore(b);
                minplus=min(now-score[x][j],minplus);
            }
            Score now=totscore[x]+maxplus;
            int gold2=gold;
            if (totscore[x]==Score{0,0}&&now!=Score{0,0}){
                gold2=min((int)ceil((n1+1)*0.1),35);
            }   
            if (now>=totscore[tmp[gold2]]) li.insert(x);
            if (totscore[x]==Score{0,0}&&haveadd==0){
                // PRINTSCORE(minplus);
                Score now=minplus;
                if (totscore[tmp[nol]]>=now&&nol<=gold2){
                    For(i,nol,nor) li.insert(tmp[i]);
                    haveadd=1;
                }
            }
        }
    }
    cout<<li.size()<<"\n";
    for (int x:li) cout<<name[x]<<" ";
    cout<<"\n";
    // sort(tmp+1,tmp+n+1,cmp);
    // For(i,1,n) cout<<name[tmp[i]]<<" "<<totscore[tmp[i]].n<<" "<<totscore[tmp[i]].t<<"\n";
    // cout<<"\n";
}
int main(){
    std::ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int T;cin>>T;
    while (T--) Main();
}