N = int(input())
S = {}
c = 0
for _ in range(N):
	s = input()
	if s not in S:
		S[s] = 1
	else:
		S[s] += 1
	c = max(c, S[s])
ans = []
for k, v in S.items():
	if v == c:
		ans.append(k)
ans.sort()
for a in ans:
	print(a) N = int(input()) N int(input()) int input() input S = {} S {} c = 0 c 0 for _ in range(N):
	s = input()
	if s not in S:
		S[s] = 1
	else:
		S[s] += 1
	c = max(c, S[s]) _ range(N) range N s = input() s input() input if s not in S:
		S[s] = 1
	else:
		S[s] += 1
	 s not in S s S S[s] = 1 S[s] S s 1 S[s] += 1 S[s] S s 1 c = max(c, S[s]) c max(c, S[s]) max c S[s] S s ans = [] ans [] for k, v in S.items():
	if v == c:
		ans.append(k) k v S.items() S.items S items if v == c:
		ans.append(k) v == c v c ans.append(k) ans.append ans append k ans.sort() ans.sort ans sort for a in ans:
	print(a) a ans print(a) print a c = max(c, S[s]) max(c, S[s]) c N = int(input()) int(input()) N c = 0 0 c s = input() input() s S = {} {} S ans = [] [] ans
N = int(input())
S = {}
c = 0
for _ in range(N):
	s = input()
	if s not in S:
		S[s] = 1
	else:
		S[s] += 1
	c = max(c, S[s])
ans = []
for k, v in S.items():
	if v == c:
		ans.append(k)
ans.sort()
for a in ans:
	print(a)
