n = int(input())
d = {}
for i in range(n):
    S = input()
    d[S] = d[S]+1 if S in d else 1
L = sorted(d.items(), key=lambda x: x[1], reverse=True)
print(*sorted([l[0] for l in L if l[1] == L[0][1]]), sep='\n') n = int(input()) n int(input()) int input() input d = {} d {} for i in range(n):
    S = input()
    d[S] = d[S]+1 if S in d else 1 i range(n) range n S = input() S input() input d[S] = d[S]+1 if S in d else 1 d[S] d S d[S]+1 if S in d else 1 S in d S d d[S]+1 d[S] d S 1 1 L = sorted(d.items(), key=lambda x: x[1], reverse=True) L sorted(d.items(), key=lambda x: x[1], reverse=True) sorted d.items() d.items d items key=lambda x: x[1] key lambda x: x[1] x[1] x 1 x reverse=True reverse True l[0] for l in L if l[1] == L[0][1] for l in L if l[1] == L[0][1] l L l[1] == L[0][1] l[1] l 1 L[0][1] [0] L 0 1 if l[1] == L[0][1] l[0] l 0 print(*sorted([l[0] for l in L if l[1] == L[0][1]]), sep='\n') print *sorted([l[0] for l in L if l[1] == L[0][1]]) sorted([l[0] for l in L if l[1] == L[0][1]]) sorted [l[0] for l in L if l[1] == L[0][1]] sep='\n' sep '\n' n = int(input()) int(input()) n d = {} {} d S = input() input() S L = sorted(d.items(), key=lambda x: x[1], reverse=True) sorted(d.items(), key=lambda x: x[1], reverse=True) L
n = int(input())
d = {}
for i in range(n):
    S = input()
    d[S] = d[S]+1 if S in d else 1
L = sorted(d.items(), key=lambda x: x[1], reverse=True)
print(*sorted([l[0] for l in L if l[1] == L[0][1]]), sep='\n')