N = int(input())

dct = {}

for i in range(N):
    s = input()
    if not s in dct:
        dct[s] = 1

    else:
        dct[s] +=  1
    
m = max(dct.values())
for s in sorted(k for k in dct if dct[k] == m):
    print(s) N = int(input()) N int(input()) int input() input dct = {} dct {} for i in range(N):
    s = input()
    if not s in dct:
        dct[s] = 1

    else:
        dct[s] +=  1
     i range(N) range N s = input() s input() input if not s in dct:
        dct[s] = 1

    else:
        dct[s] +=  1
     not s in dct s in dct s dct dct[s] = 1 dct[s] dct s 1 dct[s] +=  1 dct[s] dct s 1 m = max(dct.values()) m max(dct.values()) max dct.values() dct.values dct values for s in sorted(k for k in dct if dct[k] == m):
    print(s) s sorted(k for k in dct if dct[k] == m) sorted k print(s) print s s = input() input() s N = int(input()) int(input()) N dct = {} {} dct m = max(dct.values()) max(dct.values()) m
N = int(input())

dct = {}

for i in range(N):
    s = input()
    if not s in dct:
        dct[s] = 1

    else:
        dct[s] +=  1
    
m = max(dct.values())
for s in sorted(k for k in dct if dct[k] == m):
    print(s)