Baekjoon 1302

문제 확인하기

N = int(input())
best = {}
for i in range(N):
    book = input()
    if book not in best:
        best[book] = 1
    else:
        best[book] += 1

max_book = []
value = max(best.values())

for i in best:
    if value == best[i]:
        max_book.append(i)

print(sorted(max_book)[0])