n = int(input())
s = list(input() for _ in range(n))
d = {}
for i in range(n):
    if s[i] in d:
        d[s[i]] += 1
    else:
        d[s[i]] = 1

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

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