#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define endl '\n'
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef pair<int, int> PII;
const int N = 2e5+10;

bool cmp(pair<string,int>a,pair<string,int> b)
{
    if(a.sc==b.sc)return a.fs<b.fs;
    return a.sc>b.sc;
}
void solve()
{
    int n;
    cin>>n;

    map<string,int> mp1;
    map<string,int> mp2;

    string a,b,c;
    
    for(int i=0;i<n;i++)
    {
        cin>>a>>b>>c;
        if(!mp1[a+b]&&c[0]=='a')
        {
            mp1[a+b]=1;
            mp2[b]++;
        }
    }

    //仿函数拉倒 用vector对map的val排序
    vector<pair<string,int>> v(all(mp2));

    sort(all(v),cmp);

    cout<<v[0].fs<<endl;

    cout<<endl;
}

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

    int t;
    cin >> t;

    while (t--)
    {
        solve();
    }
    return 0;
}