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

dic = {}

for i in range(N):
  if S[i] not in dic.keys():
    dic[S[i]] = 1
    
  else:
    dic[S[i]] += 1
    
maxim = max(dic.values())
ans = []

for keys in dic.keys():
  if dic[keys] == maxim:
    ans.append(keys)
    
ans.sort()

for i in range(len(ans)):
  print(ans[i]) 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)] dic = {} dic {} for i in range(N):
  if S[i] not in dic.keys():
    dic[S[i]] = 1
    
  else:
    dic[S[i]] += 1
     i range(N) range N if S[i] not in dic.keys():
    dic[S[i]] = 1
    
  else:
    dic[S[i]] += 1
     S[i] not in dic.keys() S[i] S i dic.keys() dic.keys dic keys dic[S[i]] = 1 dic[S[i]] dic S[i] S i 1 dic[S[i]] += 1 dic[S[i]] dic S[i] S i 1 maxim = max(dic.values()) maxim max(dic.values()) max dic.values() dic.values dic values ans = [] ans [] for keys in dic.keys():
  if dic[keys] == maxim:
    ans.append(keys)
     keys dic.keys() dic.keys dic keys if dic[keys] == maxim:
    ans.append(keys)
     dic[keys] == maxim dic[keys] dic keys maxim ans.append(keys) ans.append ans append keys ans.sort() ans.sort ans sort for i in range(len(ans)):
  print(ans[i]) i range(len(ans)) range len(ans) len ans print(ans[i]) print ans[i] ans i ans = [] [] ans N = int(input()) int(input()) N maxim = max(dic.values()) max(dic.values()) maxim dic = {} {} dic S = [input() for _ in range(N)] [input() for _ in range(N)] S
N = int(input())
S = [input() for _ in range(N)]

dic = {}

for i in range(N):
  if S[i] not in dic.keys():
    dic[S[i]] = 1
    
  else:
    dic[S[i]] += 1
    
maxim = max(dic.values())
ans = []

for keys in dic.keys():
  if dic[keys] == maxim:
    ans.append(keys)
    
ans.sort()

for i in range(len(ans)):
  print(ans[i])
