## Algorithm

A. Football
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

One day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn't find the overall score of the match; however, he got hold of a profound description of the match's process. On the whole there are n lines in that description each of which described one goal. Every goal was marked with the name of the team that had scored it. Help Vasya, learn the name of the team that won the finals. It is guaranteed that the match did not end in a tie.

Input

The first line contains an integer n (1 ≤ n ≤ 100) — the number of lines in the description. Then follow n lines — for each goal the names of the teams that scored it. The names are non-empty lines consisting of uppercase Latin letters whose lengths do not exceed 10 symbols. It is guaranteed that the match did not end in a tie and the description contains no more than two different teams.

Output

Print the name of the winning team. We remind you that in football the team that scores more goals is considered the winner.

Examples
input
Copy
`1ABC`
output
Copy
`ABC`
input
Copy
`5AABAABAAA`
output
Copy
`A`

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);

int n;
cin>>n;
map<string, int> mp;
while(n--){
string s;
cin>>s;
mp[s]++;
}
int max = -1;
string maxchar;
map<string, int>::iterator i;
for(i = mp.begin(); i != mp.end(); i++){
if(max < i->second){
max = i->second;
maxchar = i->first;
}
}
cout<<maxchar<<endl;

}``````
Copy The Code &

Input

cmd
1
ABC

Output

cmd
ABC