#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const ll inf = 0x3f3f3f3f3f3f3f3fll;
const int Mod = 147744151;
const int inv[5] = {0, 1, (Mod+1) / 2, (Mod+1) / 3};
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, int p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 111;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(ll &a, ll b){ (b>a) ? (a=b) : 0; }
inline void chmin(ll &a, ll b){ (b<a) ? (a=b) : 0; }

map<string, int> mp;
int cn = 0;
int has0[100100][26], fst0[100100][26], lst0[100100][26], has1[100100][26], cnt[100100], tpen[100100][26], pen[100100], can[100100];
int nhas0[100100][26], nhas1[100100][26], ntpen[100100][26];
int m;

int ord[100100];
int calc(){
	rep(i, cn) ord[i] = i;
	//rep(i, cn) cout << "(" << cnt[i] << " " << pen[i] << ") ";
	//cout << "\n";
	sort(ord, ord + cn, [&](int lh, int rh){
		if(cnt[lh] != cnt[rh])
			return cnt[lh] > cnt[rh];
		else 
			return pen[lh] < pen[rh];
	});
	int lmt = 0;
	while(lmt < cn && cnt[ord[lmt]]) ++lmt;
	lmt = min((lmt+9) / 10, 35);
	rep(i, lmt) can[ord[i]] = 1;
	if(lmt){
		int p = lmt;
		while(p < cn && cnt[ord[p]] == cnt[ord[p-1]] && pen[ord[p]] == pen[ord[p-1]]) can[ord[p++]] = 1;
	}
	return lmt;
}

void solve(){
	mp.clear(), cn = 0;
	cin >> m;
	rep(i, m){
		memset(has0[i], 0, sizeof(has0[i])), memset(has1[i], 0, sizeof(has1[i])), can[i] = cnt[i] = pen[i] = 0;
		memset(nhas0[i], 0, sizeof(nhas0[i])), memset(nhas1[i], 0, sizeof(nhas1[i]));
	}
	while(m--){
		string c;
		char cp;
		int t;
		string s;
		cin >> c >> cp >> t >> s;
		if(!mp.count(c)) mp[c] = cn++;
		int id = mp[c];
		int p = (int)(cp - 'A'), tp = (s[0] == 'a');
		if(!has1[id][p]){
			if(tp == 1){
				pen[id] += (tpen[id][p] = (t + 20 * has0[id][p]));
				has1[id][p] = 1;
			} else {
				if(!has0[id][p]) fst0[id][p] = t;
				lst0[id][p] = t;
				++has0[id][p];
			}
		} else if(!nhas1[id][p]){
			if(tp == 1){
				ntpen[id][p] = (t + 20 * (has0[id][p] + 1 + nhas0[id][p]));
				nhas1[id][p] = 1;
			} else {
				++nhas0[id][p];
			}
		}
	}

	//cerr << cn << endl;

	rep(i, cn) rep(j, 26) cnt[i] += has1[i][j];

	int n = 0;
	rep(i, cn) n += (bool)(cnt[i]);
	int lmt = calc();

	if(!lmt){
		rep(i, cn){
			int has = 0;
			rep(j, 26) has |= has0[i][j];
			can[i] = has;
		}
	} else {
		int lst = ord[lmt-1];

		rep(i, cn) if(!can[i]){
			//cout << "! " << i << "\n";
			int mnp = -1;
			rep(j, 26) if(!has1[i][j] && has0[i][j] && (mnp < 0 || fst0[i][j] < fst0[i][mnp])){
				mnp = j;
			}
			//cout << mnp << "\n";
			if(mnp >= 0){
				if(cnt[i] == cnt[lst]) can[i] = 1;
				else {
					//cout << i << ": " << (!cnt[i] && lmt < 35 && n % 10 == 0) << "\n";
					int nxt = ord[lmt + (!cnt[i] && lmt < 35 && n % 10 == 0) - 1];
					can[i] |= (cnt[i] + 1 > cnt[nxt] || (cnt[i] + 1 == cnt[nxt] && pen[i] + fst0[i][mnp] <= pen[nxt]));
				}
			}
			mnp = -1;
			rep(j, 26) if(has1[i][j] && has0[i][j] && (mnp < 0 || fst0[i][j] - tpen[i][j] < fst0[i][mnp] - tpen[i][mnp])){
				mnp = j;
			}
			if(mnp >= 0){
				can[i] |= (cnt[i] == cnt[lst] && pen[i] + fst0[i][mnp] - tpen[i][mnp] <= pen[lst]);
			}
		}

		if(lmt){
			if(cnt[ord[lmt]] == cnt[ord[lmt-1]] && pen[ord[lmt]] == pen[ord[lmt-1]])
				;
			else {
				bool done = 0;
				rep(i, lmt){
					int u = ord[i];
					rep(j, 26) if(has1[u][j]){
						if(!nhas1[u][j] && (cnt[u] - 1 < cnt[ord[lmt]] || (cnt[u] - 1 == cnt[ord[lmt]] && pen[u] - tpen[u][j] >= pen[ord[lmt]]))){
							--cnt[u], pen[u] -= tpen[u][j];
							calc(); done = 1;
							++cnt[u], pen[u] += tpen[u][j];
						} else if(nhas1[u][j] && cnt[u] == cnt[ord[lmt]] && pen[u] - tpen[u][j] + ntpen[u][j] >= pen[ord[lmt]]){
							pen[u] += ntpen[u][j] - tpen[u][j];
							calc(); done = 1;
							pen[u] -= ntpen[u][j] - tpen[u][j];
						}
						if(done) break;
					}
					if(done) break;
				}
				if(done) calc();
			}
		}
		
		int mxi = -1, mxj = -1;
		rep(i, cn) if(!cnt[i]){
			rep(j, 26) if(has0[i][j]){
				if(mxi < 0 || lst0[i][j] + 20 * (has0[i][j] - 1) > lst0[mxi][mxj] + 20 * (has0[mxi][mxj] - 1))
					mxi = i, mxj = j;
			}
		}
		if(mxi >= 0){
			++cnt[mxi], pen[mxi] += lst0[mxi][mxj] + 20 * (has0[mxi][mxj] - 1);
			calc();
		}
	}

	int sum = 0;
	for(auto it : mp) sum += (bool)(can[it.second]);
	cout << sum << "\n";
	for(auto it : mp) if(can[it.second]) cout << it.first << " ";
	cout << "\n";
}

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

	int T;
	cin >> T;
	while(T--)
		solve();

	//cerr << 1. * clock() / CLOCKS_PER_SEC << "\n";

	return 0;
}