n = int(input())
d = {}
for i in range(n):
    s = input()
    if s not in d:
        d[s] = 1
    else:
        d[s] += 1
m = max(d.values())

ans = [_ for _ in d if d[_] == m]
ans.sort()
[print(_) for _ in ans] n = int(input()) n int(input()) int input() input d = {} d {} for i in range(n):
    s = input()
    if s not in d:
        d[s] = 1
    else:
        d[s] += 1 i range(n) range n s = input() s input() input if s not in d:
        d[s] = 1
    else:
        d[s] += 1 s not in d s d d[s] = 1 d[s] d s 1 d[s] += 1 d[s] d s 1 m = max(d.values()) m max(d.values()) max d.values() d.values d values _ for _ in d if d[_] == m for _ in d if d[_] == m _ d d[_] == m d[_] d _ m if d[_] == m _ ans = [_ for _ in d if d[_] == m] ans [_ for _ in d if d[_] == m] ans.sort() ans.sort ans sort print(_) for _ in ans for _ in ans _ ans for _ in ans print(_) print _ [print(_) for _ in ans] n = int(input()) int(input()) n d = {} {} d s = input() input() s ans = [_ for _ in d if d[_] == m] [_ for _ in d if d[_] == m] ans m = max(d.values()) max(d.values()) m
n = int(input())
d = {}
for i in range(n):
    s = input()
    if s not in d:
        d[s] = 1
    else:
        d[s] += 1
m = max(d.values())

ans = [_ for _ in d if d[_] == m]
ans.sort()
[print(_) for _ in ans]
