#include <iostream>
#include <vector>
//#include <windef.h>
#include <algorithm>
#include <cstdlib>
#include <cassert>
#include <numeric>
#include <climits>
#include <set>
#include <map>
#define ENDL endl
using i64=long long;
std::istream& CIN = std::cin;
std::ostream& COUT = std::cout;
using namespace std;

int main() {
    int tt;
    cin>>tt;
    while(tt--){
        int n;
        cin>>n;

        map<string,set<string>> smi;
        for(int i = 0;i<n;i++){
            string team,problem,status;
            CIN>>team>>problem>>status;
            if(status == "accepted"){
                smi[problem].insert(string(team.begin() + 4,team.end()));
            }
        }
        pair<int,string> ans;
        for(const auto& m:smi){
            int x = m.second.size();
            if(x > ans.first){
                ans = make_pair(x,m.first);
            }
        }
        cout<<ans.second<<endl;

    }
    return 0;
}