#include<bits/stdc++.h>

#define IOS ios::sync_with_stdio(false), cin.tie(0);
#define irep(i, l, r) for(int i = l; i <= r; ++ i)
#define drep(i, r, l) for(int i=  r; i >= l; -- i)

typedef long long ll;
typedef double LD;
using i64 = long long;
const int mod = 1000000000 + 7;
const int N = 500000 + 7;

using namespace std;
const double eps = 1e-8;
int sgn(LD x){
    if(x > eps)return 1;
    if(x < -eps)return -1;
    return 0;
}

namespace strhash{
    using u64 = uint64_t;
    mt19937_64  rng(random_device{}());
    const int base = 135 + rng() % 114514;
    constexpr int p1 = 1'0000'0000'7, p2 = 1'0000'0000'9;
    constexpr unsigned  msk32 = ~(0u);
    vector<u64> pw1{1}, pw2{1};

    class StringHash{
        vector<u64>h;
        int n;
    public:
        StringHash(const string &s): n(s.length()){
            int old_size = pw1.size();
            if(old_size < n + 1){
                pw1.resize(2 * n + 1, 1), pw2.resize(n * 2 + 1, 1);
                for(int i = old_size; i <= n * 2; ++ i){
                    pw1[i] = pw1[i - 1] * base % p1;
                    pw2[i] = pw2[i - 1] * base % p2;
                }
            }
            u64 now1 = 0, now2 = 0;
            h.resize(n + 1, 0);
            for(int i = n - 1; i >= 0; -- i){
                now1 = (now1 * base + s[i]) % p1;
                now2 = (now2 * base + s[i]) % p2;
                h[i] = (now1 << 32) | now2;
            }
        }
        u64 get(int l, int r){
            int len = r - l;
            u64 l1 = h[l] >> 32, r1 = h[r] >> 32;
            u64 l2 = h[l] & msk32, r2 = h[r] & msk32;
            u64 res1 = (l1 - r1 * pw1[len] % p1 + p1) % p1;
            u64 res2 = (l2 - r2 * pw2[len] % p2 + p2) % p2;
            return (res1 << 32) | res2;
        }
    };
}

inline ll read() {
    ll s = 0, w = 1;
    char ch = getchar();
    while (!isdigit(ch)) {
        if (ch == '-')w = -1;
        ch = getchar();
    }
    while (isdigit(ch)) {
        s *= 10, s += ch ^ 48;
        ch = getchar();
    }
    return s * w;
}

ll qpow(ll base, ll b){
    ll ans = 1;
    while(b){
        if(b & 1)ans *= base, ans %= mod;
        base *= base, base %= mod, b >>= 1;
    }
    return ans;
}

void solve(){
    int n = read();
    vector<string>s;
    map<string, set<string>>mp;
    irep(i, 1, n){
        string a, b, c;
        cin >> a >> b >> c;
        if(c == "accepted"){
            mp[b].insert(a);
        }
        s.push_back(b);
    }
    cout << *std::max_element(s.begin(), s.end(), [&](string &p, string &q){
        return mp[p].size() != mp[q].size() ? mp[p].size() < mp[q].size() : p > q;
    }) << '\n';
}

int main(){
    int T = 1;
    cin >> T;
    while(T --)solve();
}