from collections import Counter
n = int(input())
s = [str(input()) for i in range(n)]
s = Counter(s).most_common()
w = []
for h in s:
    if s[0][1] == h[1]:
        w.append(h[0])
w.sort()
for j in w:
    print(j) from collections import Counter n = int(input()) n int(input()) int input() input str(input()) for i in range(n) for i in range(n) i range(n) range n for i in range(n) str(input()) str input() input s = [str(input()) for i in range(n)] s [str(input()) for i in range(n)] s = Counter(s).most_common() s Counter(s).most_common() (s).most_common (s) Counter s most_common w = [] w [] for h in s:
    if s[0][1] == h[1]:
        w.append(h[0]) h s if s[0][1] == h[1]:
        w.append(h[0]) s[0][1] == h[1] s[0][1] [0] s 0 1 h[1] h 1 w.append(h[0]) w.append w append h[0] h 0 w.sort() w.sort w sort for j in w:
    print(j) j w print(j) print j n = int(input()) int(input()) n s = Counter(s).most_common() Counter(s).most_common() s s = [str(input()) for i in range(n)] [str(input()) for i in range(n)] s w = [] [] w
from collections import Counter
n = int(input())
s = [str(input()) for i in range(n)]
s = Counter(s).most_common()
w = []
for h in s:
    if s[0][1] == h[1]:
        w.append(h[0])
w.sort()
for j in w:
    print(j)