#include <bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(0); cin.tie(0)

using namespace std;

using ll = long long;

#define int ll
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

void solve() {
	int n; cin>>n;

	map<string, vector<vector<int>>> ac, wa;
	vector<tuple<string, int, int, bool>> ev;
	for (int i = 0; i < n; i++) {
		string c, s; char p; int t;
		cin>>c>>p>>t>>s;
		if (!ac.count(c)) {
			ac[c].resize(26);
			wa[c].resize(26);
		} 

		bool is_ac = (s == "accepted");
		if (is_ac) {
			ac[c][p-'A'].push_back(i);
		} else {
			wa[c][p-'A'].push_back(i);
		}
		ev.emplace_back(c, p-'A', t, is_ac);
	}

	auto get_penalty = [&](string s, char c, int t) {
		int lb = lower_bound(all(wa[s][c]), t) - wa[s][c].begin();
		return get<2>(ev[t]) + lb*20;
	};

	int sz = 0;
	map<string, pair<int,int>> val;
	set<tuple<int, int, string>> teams;
	for (auto [c, v]: ac) {
		int num = 0, time = 0;
		for (int i = 0; i < 26; i++) {
			if (v[i].size()) {
				num++;
				time += get_penalty(c, i, v[i][0]);
			} 
		}
		val[c] = {-num, time};
		teams.emplace(-num, time, c);
		if (num) sz++;
	}

	auto get_top_size = [&sz]() {
		return min(35LL, (sz+9)/10);
	};

	set<string> res;
	auto update = [&]() {
		int top = get_top_size(), prv_num = 1, prv_time = 1;
		for (auto [num, time, c]: teams) {
			if (top <= 0) {
				if (num != prv_num or time != prv_time) break;
			} 
			res.insert(c);
			top--;
			prv_num = num, prv_time = time;
		}
	};

	update();
	for (int i = 0; i < n; i++) {
		auto [c, p, t, is_ac] = ev[i];

		auto [num, time] = val[c];
		teams.erase({num, time, c});

		int sv_sz = sz, new_num = -num, new_time = time;
		if (is_ac) {
			if (ac[c][p][0] == i) {
				if (ac[c][p].size() > 1) {
					new_time = new_time - get_penalty(c, p, i) + get_penalty(c, p, ac[c][p][1]) + 20;
				} else {
					// nao tenho mais ac na questao atual
					new_num--;
					new_time = new_time - get_penalty(c, p, i);
					if (new_num == 0) sz--;
				}
			}
		} else {
			if (ac[c][p].size()) {
				// ja tinha ac na questao
				// se o ac for depois
				// entao quero remover a penalidade dele
				// e adicionar a do atual
				if (i < ac[c][p][0]) {
					new_time = new_time - get_penalty(c, p, ac[c][p][0]) + get_penalty(c, p, i);
				}
			} else {
				// nao tinha nenhum ac
				new_num++;
				new_time = new_time + get_penalty(c, p, i);
				if (new_num == 1) sz++;
			}
		}

		teams.insert({-new_num, new_time, c});
		update();
		teams.erase({-new_num, new_time, c});

		teams.insert({num, time, c});
		sz = sv_sz;
	}

	cout<<res.size()<<'\n';
	for (auto c: res) cout<<c<<' '; cout<<'\n';
}

signed main() {
	fastio;
	int tt; cin>>tt;
	while (tt--) {
		solve();
	}
	return 0;
}