n = int(input())
c = {}
for i in range(n):
    s = input()
    if s in c:
        c[s] += 1
    else:
        c[s] = 1
max = 0
for k in c.keys():
    if c[k] > max:
        max = c[k]
hit = [k for k in c.keys() if c[k] == max]
hit.sort()
for i in range(len(hit)):
    print(hit[i]) n = int(input()) n int(input()) int input() input c = {} c {} for i in range(n):
    s = input()
    if s in c:
        c[s] += 1
    else:
        c[s] = 1 i range(n) range n s = input() s input() input if s in c:
        c[s] += 1
    else:
        c[s] = 1 s in c s c c[s] += 1 c[s] c s 1 c[s] = 1 c[s] c s 1 max = 0 max 0 for k in c.keys():
    if c[k] > max:
        max = c[k] k c.keys() c.keys c keys if c[k] > max:
        max = c[k] c[k] > max c[k] c k max max = c[k] max c[k] c k k for k in c.keys() if c[k] == max for k in c.keys() if c[k] == max k c.keys() c.keys c keys c[k] == max c[k] c k max if c[k] == max k hit = [k for k in c.keys() if c[k] == max] hit [k for k in c.keys() if c[k] == max] hit.sort() hit.sort hit sort for i in range(len(hit)):
    print(hit[i]) i range(len(hit)) range len(hit) len hit print(hit[i]) print hit[i] hit i s = input() input() s c = {} {} c max = c[k] c[k] max n = int(input()) int(input()) n max = 0 0 max hit = [k for k in c.keys() if c[k] == max] [k for k in c.keys() if c[k] == max] hit
n = int(input())
c = {}
for i in range(n):
    s = input()
    if s in c:
        c[s] += 1
    else:
        c[s] = 1
max = 0
for k in c.keys():
    if c[k] > max:
        max = c[k]
hit = [k for k in c.keys() if c[k] == max]
hit.sort()
for i in range(len(hit)):
    print(hit[i])