H. The king of SWERC
time limit per test
0.5 seconds
memory limit per test
2048 МБ
input
standard input
output
standard output

That's it! After years of research, you finally managed to find who was the king of the infamous South Western Egyptian River City (SWERC)!

Well, not exactly. You have found the actual votes. But considering that the person who got the most votes got elected, and considering that there wasn't a tie for first place, can your code deduce who was the actual king of SWERC?

Input

The first line of the input is an integer, $$$N$$$, the number of votes. The next $$$N$$$ lines describe the votes, and each contains a name $$$V_i$$$ in capital English letters, without spaces.

It is guaranteed one name appears strictly more than the others.

Output

The output should contain a single string, the name of the king of SWERC.

Limits

  • $$$1 \leqslant N \leqslant 500$$$.
  • $$$1 \leqslant |V_i| \leqslant 20$$$, for $$$i = 1, \ldots, N$$$.
Examples
Input
1
RAMSES
Output
RAMSES
Input
4
JON
JOFFREY
TYWIN
JON
Output
JON