#include<bits/stdc++.h>
using namespace std;
const int N = 1e3;
int f[N][N];
int ans[N];
int main(){
	int q;
	cin >> q;
	memset(f,-1,sizeof f);
	while(q--){
		int n;
		cin >> n;
		for(int i = 1; i <= n; i++)
		{
			string team;char promble;string res;
			cin >> team >> promble >> res;
			int t = 0;
			for(int i = 4; i < team.size(); i ++){
				char e = team[i];
				if( e >='a' && e <='z')
					e = e - 'a' + 'A';
				else
					e = e - 'A';
				t = t *10 + team[i] - 'A';
			}
			int p = promble - 'A';
			int r;
			if(res.compare("accepted") == 0)
				r = 1;
			else
				r = 0;
			if(f[t][p] == -1 && r == 1)
				ans[p] ++;
			f[t][p] = r;
		}
		int max = -1e5;
		int base = -1;
		for(int i = 0; i < 32; i ++ ){
			if(ans[i] > max)
			{
				max = ans[i];
				base = i;
			}
		}
		cout << (char)(base + 'A') << endl;
	}
	return 0;
}