Problem:
Score: 300 points

Problem Statement

We have N voting papers. The i-th vote (1 \leq i \leq N) has the string S_i written on it.

Print all strings that are written on the most number of votes, in lexicographical order.

Constraints

1 \leq N \leq 2 \times 10^5

S_i (1 \leq i \leq N) are strings consisting of lowercase English letters.

The length of S_i (1 \leq i \leq N) is between 1 and 10 (inclusive).

Input

Input is given from Standard Input in the following format:

N
S_1
:
S_N

Output

Print all strings in question in lexicographical order.

Sample Input 1

7
beat
vet
beet
bed
vet
bet
beet

Sample Output 1

beet
vet

beet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.

Sample Input 2

8
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo

Sample Output 2

buffalo

Sample Input 3

7
bass
bass
kick
kick
bass
kick
kick

Sample Output 3

kick

Sample Input 4

4
ushi
tapu
nichia
kun

Sample Output 4

kun
nichia
tapu
ushi

Solution in Ruby (2.7.1) (judge verdict: Accepted)

n = gets.chomp.to_i
hash = Hash.new(0)
n.times do |i|
    s = gets
    s = s.chomp
    if hash.include?(s)
        hash[s] += 1
    else
        hash[s] = 1
    end
    #p hash
end
hash_kai =  hash.sort_by{|i,j| j }
#p hash_kai
arr = []
#while true
count = 0
#p hash_kai
value = hash_kai[-1]
value = value[-1]
#p value
while true
    #p hash_kai
    if hash_kai != []
    key_value = hash_kai.pop
    else
        break
    end
    #p hash_kai
    if key_value != []
        if value == key_value[-1]
        arr << key_value[0]
        else
            break
        end
    else
        break
    end
    count += 1
end
arr = arr.sort
arr.each  {|i| puts i}