题目描述

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?

输入格式

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.

输出格式

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

1
RAMSES

RAMSES

4
JON
JOFFREY
TYWIN
JON

JON

提示

$1\le N \le 500$.

$1 \le |V_i| \le 20$, for $i = 1, 2, \cdots, n$.