An election is taking place.
$N$ people voted. The $i$-th person $(1 \leq i \leq N)$ cast a vote to the candidate named $S_i$.
Find the name of the candidate who received the most votes. The given input guarantees that there is a unique candidate with the most votes.

Input is given from Standard Input in the following format:
$N$
$S_1$
$S_2$
$\vdots$
$S_N$

Print the name of the candidate who received the most votes.

$1≤N≤100$
$S_i$ is a string of length between $1$ and $10$ (inclusive) consisting of lowercase English letters.
$N$ is an integer.
There is a unique candidate with the most votes.

takahashi

takahashi got $3$ votes, and snuke got $2$, so we print takahashi.