#include<bits/stdc++.h>

 using namespace std;

 #define lson l,mid,rt<<1

 #define rson mid+1,r,rt<<1|1

 #define sqr(x) ((x)*(x))

 #define pb push_back

 #define maxn 1000005

 typedef long long ll;

 typedef unsigned long long ull;

 string str;

 map<string,int>mp;

 int main(){

     #ifndef ONLINE_JUDGE

       //  freopen("input.txt","r",stdin);

     #endif

     std::ios::sync_with_stdio(false);

     int n;

     cin>>n;

     for(int i=;i<=n;i++){

         cin>>str;

         mp[str]++;

     }

     string ans;

     int Max=;

     for(map<string,int>::iterator it=mp.begin();it!=mp.end();it++){

         if(Max < it->second){

             Max = it->second;

             ans = it->first;

         }

     }

     cout<<ans<<endl;

 }

 #include<bits/stdc++.h>

 using namespace std;

 #define lson l,mid,rt<<1

 #define rson mid+1,r,rt<<1|1

 #define sqr(x) ((x)*(x))

 #define pb push_back

 #define maxn 1000005

 typedef long long ll;

 typedef unsigned long long ull;

 string s1,s2;

 map<char,int>mp;

 int main(){

     #ifndef ONLINE_JUDGE

         freopen("input.txt","r",stdin);

     #endif

     std::ios::sync_with_stdio(false);

     getline(cin,s1);

     getline(cin,s2);

     for(int i=;i<s1.length();i++){

         mp[s1[i]]++;

     }

     int flag=;

     for(int i=;i<s2.length();i++){

         if(s2[i]==' ') continue;

         if(mp[s2[i]]){

             mp[s2[i]]--;

         }

         else{

             flag=;

         }

     }

     if(!flag) cout<<"YES"<<endl;

     else cout<<"NO"<<endl;

 }

 #include<bits/stdc++.h>

 using namespace std;

 #define lson l,mid,rt<<1

 #define rson mid+1,r,rt<<1|1

 #define sqr(x) ((x)*(x))

 #define pb push_back

 #define maxn 1000005

 typedef long long ll;

 typedef unsigned long long ull;

 ll a[];

 int book[];

 bool Check(ll a,ll b){

     ll tmpa=a;

     ll tmpb=b;

     while(tmpa){

         tmpb=tmpb*+tmpa%;

         tmpa/=;

     }

     if(tmpb%==) return true;

     tmpa=a;

     tmpb=b;

     while(tmpb){

         tmpa=tmpa*+tmpb%;

         tmpb/=;

     }

     if(tmpa%==) return true;

     return false;

 }

 int main(){

     #ifndef ONLINE_JUDGE

      //   freopen("input.txt","r",stdin);

     #endif

     std::ios::sync_with_stdio(false);

     int n;

     cin>>n;

     for(int i=;i<=n;i++) cin>>a[i];

     int ans=;

     for(int i=;i<=n;i++){

         if(!book[i]){

             for(int j=i+;j<=n;j++){

                 if(!book[j])

                 if(Check(a[i],a[j])){

                     ans++;

                     book[j]=;

                     break;

                 }

             }

         }

     }

     cout<<ans<<endl;

 }

 #include<bits/stdc++.h>

 using namespace std;

 #define lson l,mid,rt<<1

 #define rson mid+1,r,rt<<1|1

 #define sqr(x) ((x)*(x))

 #define pb push_back

 #define maxn 1000005

 typedef long long ll;

 typedef unsigned long long ull;

 int main(){

     #ifndef ONLINE_JUDGE

      //   freopen("input.txt","r",stdin);

     #endif

     std::ios::sync_with_stdio(false);

     int n,m,i,j;

     scanf("%d%d",&n,&m);

     if((n%==&&m%==)||(n==&&m>)||(m==&&n>)){

         printf("1\n%d %d 1 1\n",n,m);

         for(i=;i<=n;i++){

             if(i%==)

                 for(j=;j<=m;j++)printf("%d %d\n",i,j);

             else

                 for(j=m;j>;j--)printf("%d %d\n",i,j);

         }

         printf("1 1\n");

     }

     else if(n%==){

         printf("0\n1 1\n");

         for(i=;i<=n;i++){

             if(i%==)

                 for(j=;j<=m;j++)printf("%d %d\n",i,j);

             else

                 for(j=m;j>;j--)printf("%d %d\n",i,j);

         }

         for(i=n;i>;i--)printf("%d 1\n",i);

     }

     else{

         printf("0\n1 1\n");

         for(i=;i<=m;i++){

             if(i%==)

                 for(j=;j<=n;j++)printf("%d %d\n",j,i);

             else

                 for(j=n;j>;j--)printf("%d %d\n",j,i);

         }

         for(i=m;i>;i--)printf("1 %d\n",i);

     }

 }

 #include<bits/stdc++.h>

 using namespace std;

 #define lson l,mid,rt<<1

 #define rson mid+1,r,rt<<1|1

 #define sqr(x) ((x)*(x))

 #define pb push_back

 #define maxn 1000005

 typedef long long ll;

 typedef unsigned long long ull;

 int n,s,t[][],k[],v[][],ans;

 int main(){

     #ifndef ONLINE_JUDGE

      //   freopen("input.txt","r",stdin);

     #endif

     std::ios::sync_with_stdio(false);

     scanf("%d%d",&n,&s);

     for (int i=;i<=n;i++){

         scanf("%d",&k[i]);

         for (int j=;j<=k[i];j++){

             scanf("%d%d",&v[i][j],&t[i][j]);

             t[i][j]+=t[i][j-];

             t[i][k[i]+]=<<;

         }

     }

     for (int i=;i<n;i++)

         for (int j=i+;j<=n;j++){

             int t1=,t2=,x1=,x2=,tmp=,tmp2=-;

             while (t1<=k[i] || t2<=k[j]){

                 int tmp1=min(t[i][t1],t[j][t2]);

                 x1+=(tmp1-tmp)*v[i][t1];

                 x2+=(tmp1-tmp)*v[j][t2];

                 if (t[i][t1]<t[j][t2])  t1++;else t2++;

                 if (x1>x2 && tmp2==)   ans++;

                 if (x1<x2 && tmp2==)   ans++;

                 if (x1>x2)  tmp2=;

                 if (x1<x2)  tmp2=;

                 tmp=tmp1;

             }

         }

     printf("%d\n",ans);

 }