Time Limit: 2 sec / Memory Limit: 1024 MB
Score : 200200 points
Problem Statement
An election is taking place.
NN people voted. The ii-th person (1 \leq i \leq N)(1≤i≤N) cast a vote to the candidate named S_iSi.
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.
Constraints
-
1 \leq N \leq 1001≤N≤100
-
S_iSi is a string of length between 11 and 1010 (inclusive) consisting of lowercase English letters.
-
NN is an integer.
-
There is a unique candidate with the most votes.
Input
Input is given from Standard Input in the following format:
NN
S_1S1
S_2S2
\vdots⋮
S_NSN
Output
Print the name of the candidate who received the most votes.