#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+10; 
const ll mod=998244353;
ll a[N];
ll f[N];
void solve()
{
  ll n;
  cin>>n;
  map<string,set<string>>mp;
  for(int i=1;i<=n;i++)
  {
        string a,b,c;
        if(c[0]=='a')
        {
            mp[b].insert(a);
        }
  }
  int maxx=0;
  string ans;
  for(auto it:mp)
  {
    if(it.second.size()>maxx)
    {
        maxx=it.second.size();
        ans=it.first;
    }
  }
  cout<<ans<<"\n";
}

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