from collections import Counter as c
N = int(input())
S = list(input() for _ in range(N))
S.sort()
C, i = c(S).most_common(), 0
l, n = len(C), C[0][1]
while i < l:
  if n == C[i][1]: print(C[i][0])
  else: break
  i += 1 from collections import Counter as c N = int(input()) N int(input()) int input() input S = list(input() for _ in range(N)) S list(input() for _ in range(N)) list input() input S.sort() S.sort S sort C, i = c(S).most_common(), 0 C c(S).most_common() (S).most_common (S) c S most_common i 0 l, n = len(C), C[0][1] l len(C) len C n C[0][1] [0] C 0 1 while i < l:
  if n == C[i][1]: print(C[i][0])
  else: break
  i += 1 i < l i l if n == C[i][1]: print(C[i][0])
  else: break
   n == C[i][1] n C[i][1] [i] C i 1 i += 1 i 1 C, i = c(S).most_common(), 0 c(S).most_common() C i += 1 1 i n = len(C), C[0][1] C[0][1] n N = int(input()) int(input()) N l, n = len(C), C[0][1] len(C) l i = c(S).most_common(), 0 0 i S = list(input() for _ in range(N)) list(input() for _ in range(N)) S
from collections import Counter as c
N = int(input())
S = list(input() for _ in range(N))
S.sort()
C, i = c(S).most_common(), 0
l, n = len(C), C[0][1]
while i < l:
  if n == C[i][1]: print(C[i][0])
  else: break
  i += 1