#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define endl '\n'
#define pii pair<int, int>
#define ar2 array<int, 2>
#define ar3 array<int, 3>
#define ve vector
#define vc vector<int>
#define pb push_back
#define pf push_front
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
// int dx[] = {-1, 0, 1, 0, -1, 1, 1, -1};
// int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int llinf = 0x3f3f3f3f3f3f3f3f;
const int inf = 1e9;
const int N = 5e5 + 5;
int mod = 1e9 + 7;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int n, m, k;
void solve()
{
    cin >> n;
    set<string> st[26];
    for (int i = 1; i <= n; i++)
    {
        string a, c;
        char b;
        cin >> a >> b >> c;
        if (c == "accepted")
        {
            st[b - 'A'].insert(a);
        }
    }
    char ans;
    int mx = -1;
    for (int i = 0; i < 26; i++)
    {
        // cout << st[i].size() << endl;
        // cout << mx << endl;
        int now = st[i].size();
        if (now > mx)
        {
            // cout << mx << endl;
            mx = now;
            ans = ('A' + i);
        }
    }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    cin >> _;
    for (int i = 1; i <= _; i++)
    {
        solve();
    }
    return 0;
}