#include<bits/stdc++.h>

#pragma GCC optimize ("Ofast")

using namespace std;

#define rep(i,a,b) for(ll i = a; i<b; i++)
#define sz(v) ll(v.size())
#define all(v) v.begin(),v.end()

typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
typedef vector<pair<ll,bool>> ProbRes;

ll score(ProbRes v){
    ll fails = 0;
    ll acTime = -1;
    for(auto [t,stat]: v){
        if(stat){
            acTime = t;
            break;
        }
        fails++;
    }
    if(acTime==-1) return 0;
    else return 10000000ll-acTime-fails*20;
}

void solve(){
    set<string> problems;
    set<string> teams;
    ll m; cin>>m;

    map<string,map<string,ProbRes>> s;

    rep(i,0,m){
        ll t;
        string team,p,stat; cin>>team>>p>>t>>stat;
        s[team][p].emplace_back(t,stat=="accepted");
        problems.insert(p);
        teams.insert(team);
    }

    map<string,map<string,ll>> lwProb;
    map<string,map<string,ll>> lwAccProb;
    map<string,map<string,ll>> defProb;
    map<string,map<string,ll>> hiProb;

    map<string,ll> lw;
    map<string,ll> lwAcc;
    map<string,ll> def;
    map<string,ll> hi;

    vector<pair<ll,string>> defScoreboard;

    ll n = 0;

    for(auto [team, probRes]: s){
        for(auto [prob, res]: probRes){
            defProb[team][prob] = score(res);

            ProbRes resHi = res;
            resHi[0].second = true;
            hiProb[team][prob] = score(resHi);

            ProbRes reslwAcc = res;
            reslwAcc.back().second = true;
            lwAccProb[team][prob] = score(reslwAcc);

            ProbRes resLw = res;
            rep(i,0,sz(resLw)){
                if(resLw[i].second == true){
                    resLw[i].second = false;
                    break;
                }
            }
            lwProb[team][prob] = score(resLw);

            def[team] += defProb[team][prob];
        }
        lw[team] = hi[team] = def[team];
        lwAcc[team] = 1e18;
        for(auto [prob, res]: probRes){
            lwAcc[team] = min(lwAcc[team], def[team]-defProb[team][prob]+lwAccProb[team][prob]);
            lw[team] = min(lw[team], def[team]-defProb[team][prob]+lwProb[team][prob]);
            hi[team] = max(hi[team], def[team]-defProb[team][prob]+hiProb[team][prob]);
        }
        defScoreboard.emplace_back(def[team],team);
        n += (def[team]>0);
    }
    ll gold = min(35ll,(n+9)/10);

    set<string> goldTeams;
    sort(all(defScoreboard));
    reverse(all(defScoreboard));

    map<ll,ll> cutOff;
    cutOff[0] = 1e18;
    rep(i,0,sz(teams)){
        cutOff[i+1] = defScoreboard[i].first;
    }

    ll lwGold = 1e18;
    rep(i,0,gold){
        string team = defScoreboard[i].second;
        if(lw[team]==0 && def[team]>0)
            lwGold = min(lwGold,min(cutOff[min(35ll,((n-1)+9)/10)],max(lw[team],cutOff[min(35ll,((n-1)+9)/10)+1])));
        else
            lwGold = min(lwGold,min(cutOff[min(35ll,(n+9)/10)],max(lw[team],cutOff[min(35ll,(n+9)/10)+1])));
    }

    rep(i,0,sz(teams)){
        string team = defScoreboard[i].second;
        if(def[team]==0){
            lwGold = min(lwGold, max(lwAcc[team], cutOff[min(35ll,(n+1+9)/10)]));
        }
    }

    rep(i,0,sz(teams)){
        string team = defScoreboard[i].second;
        if(def[team]>=lwGold) goldTeams.insert(team);

        if(hi[team]>0 && def[team]==0){
            if(hi[team]>=cutOff[min(35ll,((n+1)+9)/10)]) goldTeams.insert(team);
        } else {
            if(hi[team]>=cutOff[min(35ll,(n+9)/10)]) goldTeams.insert(team);
        }
    }

    cout<<sz(goldTeams)<<"\n";
    for(auto x: goldTeams) cout<<x<<" ";
    cout<<"\n";
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    ll t; cin>>t;
    while(t--) solve();
}