#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <array>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
using ll = long long;

void eachT() {
	int n;
	cin >> n;

	map<string, vector<string>> a;
	while (n--) {
		string name, id, op;
		cin >> name >> id >> op;

		if (op[0] == 'a') {
			a[id].push_back(name);
		}
	}

	string mx = "";
	for (auto& [k, vec] : a) {

		if (a[mx].size() < a[k].size()) {
			mx = k;
		}
	}

	cout << mx << '\n';
}

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

	int T = 1;
	cin >> T;

	while (T--) {
		eachT();
	}

	return 0;
}