I. Shamalli the crab
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In the deep aqua biome, there exist more than $$$4000$$$ species of crabs, each with its own magnificent and unique appearance.

One day, Shamalli arrived at Aqaba and decided to go diving. As he descended into the depths, he was amazed by the breathtaking beauty of the biome — colorful corals, shimmering water, and countless fascinating sea creatures all around him.

Shamalli loves eating crabs, but today he decided to do something different — he wanted to learn more about them instead. Every time he encountered a crab, he carefully memorized its species, paying close attention to its features and trying not to forget any of them.

After finishing his dive, he called his friends Mukhtar and Dabbour and excitedly told them about what he had seen. Curious, they asked him one question:

What is the most common crab species you saw?

Shamalli remembers all the crabs he encountered, but determining the species that appeared the most is not as easy as it sounds. Help him find the crab species with the highest frequency.

Input

The first line contains a single integer $$$n$$$ $$$(1 \le n \le 7 \cdot 10^4)$$$ — the number of crabs Shamalli encountered during his dive.

The next $$$n$$$ lines each contain a string $$$s_i$$$, representing the species of a crab.

Output

Output a single string — the species that appeared the maximum number of times among the observed crabs.

If there are multiple species with the same maximum number of appearances, output the lexicographically smallest one.

Example
Input
10
callinectes
menippe
ocypode
callinectes
emerita
callinectes
menippe
callinectes
ocypode
emerita
Output
callinectes
Note

It is guaranteed that each species string consists only of lowercase English letters.