N = int(input())
A = {}
for i in range(N):
  s = input()
  if s in A:
    A[s] += 1
  else:
    A[s] = 1
s_max = max(A.values())
for j in sorted(k for k in A if A[k] == s_max):
  print(j) N = int(input()) N int(input()) int input() input A = {} A {} for i in range(N):
  s = input()
  if s in A:
    A[s] += 1
  else:
    A[s] = 1 i range(N) range N s = input() s input() input if s in A:
    A[s] += 1
  else:
    A[s] = 1 s in A s A A[s] += 1 A[s] A s 1 A[s] = 1 A[s] A s 1 s_max = max(A.values()) s_max max(A.values()) max A.values() A.values A values for j in sorted(k for k in A if A[k] == s_max):
  print(j) j sorted(k for k in A if A[k] == s_max) sorted k print(j) print j A = {} {} A s_max = max(A.values()) max(A.values()) s_max s = input() input() s N = int(input()) int(input()) N
N = int(input())
A = {}
for i in range(N):
  s = input()
  if s in A:
    A[s] += 1
  else:
    A[s] = 1
s_max = max(A.values())
for j in sorted(k for k in A if A[k] == s_max):
  print(j)