#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int MAXN = 1e5 + 5;

struct Team{
    string name;
    vector<pair<int, int>> sub[26];
    pair<int, int> s[26];
    pair<int, int> res, bestRes, worstRes;
    Team(string name = "") :name(name) {}
    void calc() {
        int score = 0, time = 0;
        for(int p = 0; p < 26; p++) {
            int now = -1;
            s[p] = make_pair(0, 0);
            for(auto [t, sta] : sub[p]) {
                if(sta == 1) {
                    if(now < 0) {
                        time += (-now - 1) * 20 + t, score++;
                        s[p] = make_pair(1, (-now - 1) * 20 + t);
                        now = -now;
                    }
                } else if(now < 0) now--;
            }
        }
        res = make_pair(score, -time);
        
        bestRes = res;
        for(int p = 0; p < 26; p++) {
            int now = -1, tt = 0, Time = time - s[p].second, Score = score - s[p].first;
            for(auto [t, sta] : sub[p]) {
                if(now < 0) {
                    Time += (-now - 1) * 20 + t, Score++, now = -now;
                }
            }
            bestRes = max(bestRes, make_pair(Score, -Time));
        }
        worstRes = res;
        for(int p = 0; p < 26; p++) {
            int now = -1, tt = 0, Time = time - s[p].second, Score = score - s[p].first;
            for(auto [t, sta] : sub[p]) {
                if(sta == 1 && tt != 0) {
                    if(now < 0) {
                        Time += (-now - 1) * 20 + t, Score++, now = -now;
                    }
                } else if(now < 0) now--, (sta == 1 ? tt = 1 : 0);
            }
            worstRes = min(worstRes, make_pair(Score, -Time));
        }
    }
};
vector<Team> teams;
map<string, int> Id;
int n, m, now;
set<string> ans;

pair<int, int> Calc1(Team Now) {
    int time = 0;
    for(int p = 0; p < 26; p++) {
        int now = -1;
        for(auto [t, sta] : Now.sub[p]) {
            time = max(time, (-now - 1) * 20 + t), now--;
        }
    }
    return make_pair(1, -time);
}

void solve() {
    cin >> m;
    for(int i = 1; i <= m; i++) {
        string c, p, s;
        int t;  
        cin >> c >> p >> t >> s;
        if(!Id.count(c)){
            Id[c] = now++;
            teams.push_back(Team(c));
        } 
        teams[Id[c]].sub[p[0] - 'A'].emplace_back(t, s[0] == 'a');
    }    
    for(auto&team : teams) team.calc();

    sort(teams.begin(), teams.end(), [](Team a, Team b) {return a.res > b.res;});
    int cnt = 0, tt = 0;
    for(auto o : teams) if(o.res.first) cnt++;
    int lim = min(35, (cnt + 9) / 10);

    pair<int, int> Upper = make_pair(1e9, 0), NotLower = make_pair(1e9, 0); 
    if(cnt != now && min(cnt / 10 + 1, 35) > lim) {
        for(auto team : teams) if(!team.res.first) {
            Upper = min(Upper, Calc1(team));
        }
    }
    for(int i = 0; i < lim; i++) {
        if(min((cnt + 8) / 10, 35) == lim || teams[i].worstRes.first != 0) {
            NotLower = min(NotLower, teams[i].worstRes);
        } 
    }

    for(int i = 0; i < teams.size(); i++) {
        if(teams[i].bestRes >= teams[(teams[i].res.first ? lim : min(cnt / 10 + 1, 35)) - 1].res) ans.insert(teams[i].name);
        else if(teams[i].res == teams[lim].res && (Upper <= teams[i].res)) {
            ans.insert(teams[i].name);
        } else if(teams[i].res == teams[lim].res && (NotLower <= teams[i].worstRes)) {
            ans.insert(teams[i].name);
        }
    }
    cout << ans.size() << '\n';
    for(auto name : ans) cout << name << ' ';
    cout << '\n';
    now = 0, Id.clear(), ans.clear(), teams.clear();

}

int main() {
    // ios :: sync_with_stdio(0);
    // cin.tie(0), cout.tie(0);
    int t; cin >> t;
    for(; t--; ) {
        solve();
    }

    return 0;
}