from collections import Counter
n = int(input())
s = [str(input()) for _ in range(n)]
num = Counter(s)
ans = []
ma = max(num.values())
for i in sorted(num):
    if num[i] == ma:
        print(i) from collections import Counter n = int(input()) n int(input()) int input() input str(input()) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) str(input()) str input() input s = [str(input()) for _ in range(n)] s [str(input()) for _ in range(n)] num = Counter(s) num Counter(s) Counter s ans = [] ans [] ma = max(num.values()) ma max(num.values()) max num.values() num.values num values for i in sorted(num):
    if num[i] == ma:
        print(i) i sorted(num) sorted num if num[i] == ma:
        print(i) num[i] == ma num[i] num i ma print(i) print i ma = max(num.values()) max(num.values()) ma num = Counter(s) Counter(s) num s = [str(input()) for _ in range(n)] [str(input()) for _ in range(n)] s ans = [] [] ans n = int(input()) int(input()) n
from collections import Counter
n = int(input())
s = [str(input()) for _ in range(n)]
num = Counter(s)
ans = []
ma = max(num.values())
for i in sorted(num):
    if num[i] == ma:
        print(i)