#include <iostream>
#include <string>
#include <algorithm>
#include <map>
using namespace std;
 
int main() {
	string s,t,maxs;
	int c,max=0,min=10000000;
	map<string,pair<int,int> >m;
	for(int i=1;i<=6;i++)
	{
		cin >> t;
		cin >> s;
		cin >> c;
		if(m.count(s)==0)
		{
			m[s]=make_pair(c,1);
			if(max<=1&&c<min)
			{
				max=1;
				min=c;
				maxs=s;
			}
		}
		else
		{
			(m[s].second)+=1;
			if(c<m[s].first)m[s].first=c;
			if(m[s].second>max||(max==m[s].second && min>m[s].first))
			{
				max=m[s].second;
				min=m[s].first;
				maxs=s;
			}
		}
	}
	cout << maxs;
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8bWFwPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwogCmludCBtYWluKCkgewoJc3RyaW5nIHMsdCxtYXhzOwoJaW50IGMsbWF4PTAsbWluPTEwMDAwMDAwOwoJbWFwPHN0cmluZyxwYWlyPGludCxpbnQ+ID5tOwoJZm9yKGludCBpPTE7aTw9NjtpKyspCgl7CgkJY2luID4+IHQ7CgkJY2luID4+IHM7CgkJY2luID4+IGM7CgkJaWYobS5jb3VudChzKT09MCkKCQl7CgkJCW1bc109bWFrZV9wYWlyKGMsMSk7CgkJCWlmKG1heDw9MSYmYzxtaW4pCgkJCXsKCQkJCW1heD0xOwoJCQkJbWluPWM7CgkJCQltYXhzPXM7CgkJCX0KCQl9CgkJZWxzZQoJCXsKCQkJKG1bc10uc2Vjb25kKSs9MTsKCQkJaWYoYzxtW3NdLmZpcnN0KW1bc10uZmlyc3Q9YzsKCQkJaWYobVtzXS5zZWNvbmQ+bWF4fHwobWF4PT1tW3NdLnNlY29uZCAmJiBtaW4+bVtzXS5maXJzdCkpCgkJCXsKCQkJCW1heD1tW3NdLnNlY29uZDsKCQkJCW1pbj1tW3NdLmZpcnN0OwoJCQkJbWF4cz1zOwoJCQl9CgkJfQoJfQoJY291dCA8PCBtYXhzOwoJcmV0dXJuIDA7Cn0=

YQphYQozCmEKYWEKMgphCmFhCjUKYgpiYgowCmIKYmIKMApiCmJiCjA=

a
aa
3
a
aa
2
a
aa
5
b
bb
0
b
bb
0
b
bb
0