N=int(input())
l=[input() for _ in range(N)]

l= sorted(l)

import collections
c = collections.Counter(l)
d = c.most_common()

for i in range(len(d)):
    if d[i][1] == d[0][1]:
        print(d[i][0]) N=int(input()) N int(input()) int input() input input() for _ in range(N) for _ in range(N) _ range(N) range N for _ in range(N) input() input l=[input() for _ in range(N)] l [input() for _ in range(N)] l= sorted(l) l sorted(l) sorted l import collections collections c = collections.Counter(l) c collections.Counter(l) collections.Counter collections Counter l d = c.most_common() d c.most_common() c.most_common c most_common for i in range(len(d)):
    if d[i][1] == d[0][1]:
        print(d[i][0]) i range(len(d)) range len(d) len d if d[i][1] == d[0][1]:
        print(d[i][0]) d[i][1] == d[0][1] d[i][1] [i] d i 1 d[0][1] [0] d 0 1 print(d[i][0]) print d[i][0] [i] d i 0 c = collections.Counter(l) collections.Counter(l) c N=int(input()) int(input()) N l=[input() for _ in range(N)] [input() for _ in range(N)] l l= sorted(l) sorted(l) l d = c.most_common() c.most_common() d
N=int(input())
l=[input() for _ in range(N)]

l= sorted(l)

import collections
c = collections.Counter(l)
d = c.most_common()

for i in range(len(d)):
    if d[i][1] == d[0][1]:
        print(d[i][0])