import collections
n=int(input())
s = [(input()) for _ in range(n)]
c = collections.Counter(s)
b = max(c.values())
l = [key for key in c.keys() if c[key] == b]
l.sort()
for i in l:
    print(i) import collections collections 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 s = [(input()) for _ in range(n)] s [(input()) for _ in range(n)] c = collections.Counter(s) c collections.Counter(s) collections.Counter collections Counter s b = max(c.values()) b max(c.values()) max c.values() c.values c values key for key in c.keys() if c[key] == b for key in c.keys() if c[key] == b key c.keys() c.keys c keys c[key] == b c[key] c key b if c[key] == b key l = [key for key in c.keys() if c[key] == b] l [key for key in c.keys() if c[key] == b] l.sort() l.sort l sort for i in l:
    print(i) i l print(i) print i s = [(input()) for _ in range(n)] [(input()) for _ in range(n)] s l = [key for key in c.keys() if c[key] == b] [key for key in c.keys() if c[key] == b] l b = max(c.values()) max(c.values()) b c = collections.Counter(s) collections.Counter(s) c n=int(input()) int(input()) n
import collections
n=int(input())
s = [(input()) for _ in range(n)]
c = collections.Counter(s)
b = max(c.values())
l = [key for key in c.keys() if c[key] == b]
l.sort()
for i in l:
    print(i)