n=int(input())
s=[input() for _ in range(n)]
from collections import Counter
c=Counter(s)
d=[]
x=c.most_common()[0][1]
for k in c.keys():
    if c[k]==x:
        d.append(k)

d.sort()
print(*d,sep='\n') 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)] from collections import Counter c=Counter(s) c Counter(s) Counter s d=[] d [] x=c.most_common()[0][1] x c.most_common()[0][1] [0] c.most_common() c.most_common c most_common 0 1 for k in c.keys():
    if c[k]==x:
        d.append(k) k c.keys() c.keys c keys if c[k]==x:
        d.append(k) c[k]==x c[k] c k x d.append(k) d.append d append k d.sort() d.sort d sort print(*d,sep='\n') print *d d sep='\n' sep '\n' c=Counter(s) Counter(s) c d=[] [] d s=[input() for _ in range(n)] [input() for _ in range(n)] s n=int(input()) int(input()) n x=c.most_common()[0][1] c.most_common()[0][1] x
n=int(input())
s=[input() for _ in range(n)]
from collections import Counter
c=Counter(s)
d=[]
x=c.most_common()[0][1]
for k in c.keys():
    if c[k]==x:
        d.append(k)

d.sort()
print(*d,sep='\n')