#include <bits/stdc++.h>
#define upd(x, y) x = max(x, y)
using namespace std;
const int N = 1e5 + 5;
int T, subm_n, team_n, validTeam_n, goldLim, covR[N], pos[N];
string teamName[N]; map<string, int> dict; vector<pair<int, bool>> subm[N][26];
struct Pair {
  int solved, penalty;
  Pair() {}
  Pair(int _solved, int _penalty): solved(_solved), penalty(_penalty) {}
  bool operator < (const Pair &_) const {
    return solved == _.solved ? penalty < _.penalty : solved > _.solved;
  }
  bool operator == (const Pair &_) const {
    return solved == _.solved && penalty == _.penalty;
  }
  Pair operator + (const Pair &_) const {
    return Pair(solved + _.solved, penalty + _.penalty);
  }
  Pair operator - (const Pair &_) const {
    return Pair(solved - _.solved, penalty - _.penalty);
  }
} result[N]; vector<Pair> change[N]; map<Pair, vector<int>> rklist;
void mian() {
  cin >> subm_n;
  team_n = 0, dict.clear();
  while (subm_n--) {
    string team, prob, stat; int when; cin >> team >> prob >> when >> stat;
    if (dict.find(team) == dict.end()) {
      teamName[++team_n] = team, dict[team] = team_n;
      for (int j = 0; j < 26; ++j) subm[team_n][j].clear();
    }
    int teamId = dict[team];
    subm[teamId][prob[0] - 'A'].emplace_back(when, stat[0] == 'a');
  }
  validTeam_n = 0, rklist.clear();
  for (int i = 1; i <= team_n; ++i) {
    result[i] = {0, 0}, change[i].clear();
    for (int j = 0; j < 26; ++j) if (!subm[i][j].empty()) {
      int tries = 0, accpt = 0; Pair res = {0, 0};
      for (auto it: subm[i][j])
        if (it.second) { res = {1, it.first + 20 * tries}; break; }
        else ++tries;
      result[i] = result[i] + res, tries = 0;
      for (auto it: subm[i][j])
        if (it.second) {
          if (++accpt == 2) {
            change[i].emplace_back(Pair(1, it.first + 20 * (tries + 1)) - res);
            break;
          }
        } else {
          if (!accpt)
            change[i].emplace_back(Pair(1, it.first + 20 * tries) - res);
          ++tries;
        }
      if (accpt == 1) { change[i].emplace_back(Pair(0, 0) - res); }
    }
    rklist[result[i]].emplace_back(i); if (result[i].solved) ++validTeam_n;
  }
  goldLim = min(35, (validTeam_n + 9) / 10);
  for (int i = 1; i <= team_n; ++i) covR[i] = 0;
  int t = 0;
  for (auto &it: rklist) {
    int pre = t;
    for (int i: it.second) pos[i] = ++t;
    if (pre < goldLim) covR[1] = t;
  }
  for (int i = 1; i <= team_n; ++i) for (Pair delta: change[i]) {
    Pair _result = result[i] + delta;
    goldLim = min(35,
         (validTeam_n + (_result.solved > 0) - (result[i].solved > 0) + 9) / 10
         );
    rklist[_result].emplace_back(i);
    t = 0; int until = 0; bool selfGold = false;
    for (auto &it: rklist) {
      if (t >= goldLim) break;
      t += it.second.size() - (it.first == result[i]);
      until += it.second.size();
      if (it.first == _result) --until, selfGold = true;
    }
    if (!selfGold && pos[i] <= until)
      upd(covR[1], pos[i] - 1), upd(covR[pos[i] + 1], until);
    else upd(covR[1], until);
    if (selfGold) upd(covR[pos[i]], pos[i]);
    rklist[_result].pop_back();
    if (rklist[_result].empty()) rklist.erase(_result);
  }
  vector<int> ans; t = 0; int mxR = 0;
  for (auto &it: rklist) for (int i: it.second) {
    upd(mxR, covR[++t]); if (t <= mxR) ans.emplace_back(i);
  }
  cout << ans.size() << '\n'; for (int i: ans) cout << teamName[i] << ' ';
  cout << '\n';
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> T; while (T--) mian();
  return 0;
}