n = int(input())
s = [input() for _ in range(n)]
 
d = {}
for i in s:
    if i not in d:
        d[i] = 1
    else:
        d[i] += 1
        
m = max(d.values())

l = []
for i in d.keys():
  if d[i] == m:
  	l.append(i)
    
l_s = sorted(l)
for i in l_s:
  print(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)] d = {} d {} for i in s:
    if i not in d:
        d[i] = 1
    else:
        d[i] += 1
         i s if i not in d:
        d[i] = 1
    else:
        d[i] += 1
         i not in d i d d[i] = 1 d[i] d i 1 d[i] += 1 d[i] d i 1 m = max(d.values()) m max(d.values()) max d.values() d.values d values l = [] l [] for i in d.keys():
  if d[i] == m:
  	l.append(i)
     i d.keys() d.keys d keys if d[i] == m:
  	l.append(i)
     d[i] == m d[i] d i m l.append(i) l.append l append i l_s = sorted(l) l_s sorted(l) sorted l for i in l_s:
  print(i) i l_s print(i) print i l = [] [] l n = int(input()) int(input()) n s = [input() for _ in range(n)] [input() for _ in range(n)] s l_s = sorted(l) sorted(l) l_s m = max(d.values()) max(d.values()) m d = {} {} d
n = int(input())
s = [input() for _ in range(n)]
 
d = {}
for i in s:
    if i not in d:
        d[i] = 1
    else:
        d[i] += 1
        
m = max(d.values())

l = []
for i in d.keys():
  if d[i] == m:
  	l.append(i)
    
l_s = sorted(l)
for i in l_s:
  print(i)