N = int(input())
S = [input() for _ in range(N)]

S = sorted(S)
newS = sorted(list(set(S)))
frq = [0] * len(newS)

si = index = 0
for i in range(N):
    if i == N-1:
        frq[index] = N - si
    elif S[i] != S[i+1]:
        frq[index] = i + 1 - si
        si = i + 1
        index += 1
    
ma = max(frq)
for i in range(len(newS)):
    if frq[i] == ma:
        print(newS[i]) N = int(input()) N int(input()) int input() input input() for _ in range(N) for _ in range(N) _ range(N) range N for _ in range(N) input() input S = [input() for _ in range(N)] S [input() for _ in range(N)] S = sorted(S) S sorted(S) sorted S newS = sorted(list(set(S))) newS sorted(list(set(S))) sorted list(set(S)) list set(S) set S frq = [0] * len(newS) frq [0] * len(newS) [0] 0 len(newS) len newS si = index = 0 si 0 = index = 0 index 0 for i in range(N):
    if i == N-1:
        frq[index] = N - si
    elif S[i] != S[i+1]:
        frq[index] = i + 1 - si
        si = i + 1
        index += 1
     i range(N) range N if i == N-1:
        frq[index] = N - si
    elif S[i] != S[i+1]:
        frq[index] = i + 1 - si
        si = i + 1
        index += 1
     i == N-1 i N-1 N 1 frq[index] = N - si frq[index] frq index N - si N si elif S[i] != S[i+1]:
        frq[index] = i + 1 - si
        si = i + 1
        index += 1
     S[i] != S[i+1] S[i] S i S[i+1] S i+1 i 1 frq[index] = i + 1 - si frq[index] frq index i + 1 - si i + 1 i 1 si si = i + 1 si i + 1 i 1 index += 1 index 1 ma = max(frq) ma max(frq) max frq for i in range(len(newS)):
    if frq[i] == ma:
        print(newS[i]) i range(len(newS)) range len(newS) len newS if frq[i] == ma:
        print(newS[i]) frq[i] == ma frq[i] frq i ma print(newS[i]) print newS[i] newS i index += 1 1 index N = int(input()) int(input()) N S = [input() for _ in range(N)] [input() for _ in range(N)] S ma = max(frq) max(frq) ma si = index = 0 0 si si = i + 1 i + 1 si frq = [0] * len(newS) [0] * len(newS) frq S = sorted(S) sorted(S) S newS = sorted(list(set(S))) sorted(list(set(S))) newS index = 0 0 index
N = int(input())
S = [input() for _ in range(N)]

S = sorted(S)
newS = sorted(list(set(S)))
frq = [0] * len(newS)

si = index = 0
for i in range(N):
    if i == N-1:
        frq[index] = N - si
    elif S[i] != S[i+1]:
        frq[index] = i + 1 - si
        si = i + 1
        index += 1
    
ma = max(frq)
for i in range(len(newS)):
    if frq[i] == ma:
        print(newS[i])