//
// Created by 2 on 2024/9/15/015.
//
#include <bits/stdc++.h>

using namespace std;

#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define IOS ios::sync_with_stdio(false); cin.tie(0)
#define endl '\n'

using pii = pair<int, int>;
using ll = long long;
const int N = 2e5 + 10;
const int mod = 1e9;
const ll MAX = 1e18;

void solve() {
    int n;
    cin >> n;
    string s, y;
    char x;
    set<string> st[26];
    for (int i = 0; i < n; ++i) {
        cin >> s >> x >> y;
        if (y == "accepted")
            st[x - 'A'].insert(s);
    }
    int mx = 0;
    for (const auto &item: st)
        mx = max(mx, (int)size(item));

    for (int i = 0; i < 26; ++i)
        if (st[i].size() == mx) {
            cout << i + 'A' << endl;
            return;
        }
}

int main() {
    IOS;
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}