n = int(input())
dd = {}
for i in range(n):
	s = input()
	if s in dd.keys():
		dd[s] += 1
	else:
		dd[s] = 1
ma = max(dd.values())
lst = []
for k, v in dd.items():
	if v == ma:
		lst.append(k)
for l in sorted(lst):
	print(l) n = int(input()) n int(input()) int input() input dd = {} dd {} for i in range(n):
	s = input()
	if s in dd.keys():
		dd[s] += 1
	else:
		dd[s] = 1 i range(n) range n s = input() s input() input if s in dd.keys():
		dd[s] += 1
	else:
		dd[s] = 1 s in dd.keys() s dd.keys() dd.keys dd keys dd[s] += 1 dd[s] dd s 1 dd[s] = 1 dd[s] dd s 1 ma = max(dd.values()) ma max(dd.values()) max dd.values() dd.values dd values lst = [] lst [] for k, v in dd.items():
	if v == ma:
		lst.append(k) k v dd.items() dd.items dd items if v == ma:
		lst.append(k) v == ma v ma lst.append(k) lst.append lst append k for l in sorted(lst):
	print(l) l sorted(lst) sorted lst print(l) print l dd = {} {} dd s = input() input() s n = int(input()) int(input()) n lst = [] [] lst ma = max(dd.values()) max(dd.values()) ma
n = int(input())
dd = {}
for i in range(n):
	s = input()
	if s in dd.keys():
		dd[s] += 1
	else:
		dd[s] = 1
ma = max(dd.values())
lst = []
for k, v in dd.items():
	if v == ma:
		lst.append(k)
for l in sorted(lst):
	print(l)