C - Poll /

### 問題文

N 枚の投票用紙があり、i\ (1 \leq i \leq N) 枚目には文字列 S_i が書かれています。

### 制約

• 1 \leq N \leq 2 \times 10^5
• S_i は英小文字のみからなる文字列 (1 \leq i \leq N)
• S_i の長さは 1 以上 10 以下 (1 \leq i \leq N)

### 入力

N
S_1
:
S_N


### 出力

あてはまる文字列を全て辞書順で小さい順に、改行区切りで出力せよ。

### 入力例 1

7
beat
vet
beet
bed
vet
bet
beet


### 出力例 1

beet
vet


### 入力例 2

8
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo


### 出力例 2

buffalo


### 入力例 3

7
bass
bass
kick
kick
bass
kick
kick


### 出力例 3

kick


### 入力例 4

4
ushi
tapu
nichia
kun


### 出力例 4

kun
nichia
tapu
ushi


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