#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<tuple>
#include<deque>
#include<stack>
#include<sstream>
#include<limits.h>

using namespace std;

#define int long long
#define ull unsigned long long
#define __md ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl '\n'
#define mem(h,x) memset(h,x,sizeof h);
#define py cout<<"YES"<<endl;
#define pn cout<<"NO"<<endl;
#define PII pair<int,int>
#define PCS pair<char,int>
#define PSI pair<string,int>
#define PBS pair<bool,string>
#define PSS pair<string,string> 
int gcd(int a, int b){ return b?gcd(b, a%b):a;}
int lcm(int a, int b){ return a*b/gcd(a,b);}
int ne[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
//int nefire[8][2]={{0,1},{1,0},{0,-1},{-1,0},{-1,-1},{-1,1},{1,-1},{1,1}};
constexpr int N=1e7+5,mod=1e9+7;
map<pair<string,string>,int> mp;
map<string,int> h;
void solve()
{
  int n;cin>>n;
  int maxd=0;
  while(n--)
  {
    string a,b,c;cin>>a>>b>>c;
    if(c=="accepted"&&!mp[{a,b}])
    {
        mp[{a,b}]=1;
        h[b]++;
        maxd=max(maxd,h[b]);
    }
  }
  string res;
  for(auto [a,b]:h)
  {
    if(b==maxd)
    {
        cout<<a<<endl;
        return ;
    }
  }
}

int32_t main()
{
    __md
   int t;cin>>t;
   //t=1;
   while(t--)
   {
      solve();
   }
    
}