N = int(input())
p = dict()
for i in range(N):
    s = input()
    if not s in p:
        p[s] = 0
    p[s] += 1
m = max(p.values())
ans = [k for k in p.keys() if p[k] == m]
ans = sorted(ans)
for j in range(len(ans)):
    print(ans[j]) N = int(input()) N int(input()) int input() input p = dict() p dict() dict for i in range(N):
    s = input()
    if not s in p:
        p[s] = 0
    p[s] += 1 i range(N) range N s = input() s input() input if not s in p:
        p[s] = 0
     not s in p s in p s p p[s] = 0 p[s] p s 0 p[s] += 1 p[s] p s 1 m = max(p.values()) m max(p.values()) max p.values() p.values p values k for k in p.keys() if p[k] == m for k in p.keys() if p[k] == m k p.keys() p.keys p keys p[k] == m p[k] p k m if p[k] == m k ans = [k for k in p.keys() if p[k] == m] ans [k for k in p.keys() if p[k] == m] ans = sorted(ans) ans sorted(ans) sorted ans for j in range(len(ans)):
    print(ans[j]) j range(len(ans)) range len(ans) len ans print(ans[j]) print ans[j] ans j s = input() input() s p = dict() dict() p m = max(p.values()) max(p.values()) m N = int(input()) int(input()) N ans = sorted(ans) sorted(ans) ans ans = [k for k in p.keys() if p[k] == m] [k for k in p.keys() if p[k] == m] ans
N = int(input())
p = dict()
for i in range(N):
    s = input()
    if not s in p:
        p[s] = 0
    p[s] += 1
m = max(p.values())
ans = [k for k in p.keys() if p[k] == m]
ans = sorted(ans)
for j in range(len(ans)):
    print(ans[j])