n=int(input())

dic={}
for i in range(n):
  s=input()
  if s not in dic:
    dic[s]=1
  else:
    dic[s]+=1


dic = sorted(dic.items(),key=lambda x:x[0])
dic = sorted(dic,key=lambda x:x[1],reverse=True)

ma=dic[0][1]
for i,v in dic:
  if v!=ma:
    break
  else:
    print(i) n=int(input()) n int(input()) int input() input dic={} dic {} for i in range(n):
  s=input()
  if s not in dic:
    dic[s]=1
  else:
    dic[s]+=1 i range(n) range n s=input() s input() input if s not in dic:
    dic[s]=1
  else:
    dic[s]+=1 s not in dic s dic dic[s]=1 dic[s] dic s 1 dic[s]+=1 dic[s] dic s 1 dic = sorted(dic.items(),key=lambda x:x[0]) dic sorted(dic.items(),key=lambda x:x[0]) sorted dic.items() dic.items dic items key=lambda x:x[0] key lambda x:x[0] x[0] x 0 x dic = sorted(dic,key=lambda x:x[1],reverse=True) dic sorted(dic,key=lambda x:x[1],reverse=True) sorted dic key=lambda x:x[1] key lambda x:x[1] x[1] x 1 x reverse=True reverse True ma=dic[0][1] ma dic[0][1] [0] dic 0 1 for i,v in dic:
  if v!=ma:
    break
  else:
    print(i) i v dic if v!=ma:
    break
  else:
    print(i) v!=ma v ma break print(i) print i ma=dic[0][1] dic[0][1] ma dic={} {} dic dic = sorted(dic,key=lambda x:x[1],reverse=True) sorted(dic,key=lambda x:x[1],reverse=True) dic dic = sorted(dic.items(),key=lambda x:x[0]) sorted(dic.items(),key=lambda x:x[0]) dic s=input() input() s n=int(input()) int(input()) n
n=int(input())

dic={}
for i in range(n):
  s=input()
  if s not in dic:
    dic[s]=1
  else:
    dic[s]+=1


dic = sorted(dic.items(),key=lambda x:x[0])
dic = sorted(dic,key=lambda x:x[1],reverse=True)

ma=dic[0][1]
for i,v in dic:
  if v!=ma:
    break
  else:
    print(i)