import collections

N = int(input())
S = [input() for _ in range(N)]
S.sort()
#print(S)
ans = collections.Counter(S)
values, cnt = zip(*ans.most_common())
#print(values)
#print(cnt)
max_count = cnt[0]
for i in range(len(cnt)):
    if max_count > cnt[i]:
        break
    print(values[i]) import collections collections 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.sort() S.sort S sort ans = collections.Counter(S) ans collections.Counter(S) collections.Counter collections Counter S values, cnt = zip(*ans.most_common()) values zip(*ans.most_common()) zip *ans.most_common() ans.most_common() ans.most_common ans most_common cnt max_count = cnt[0] max_count cnt[0] cnt 0 for i in range(len(cnt)):
    if max_count > cnt[i]:
        break
    print(values[i]) i range(len(cnt)) range len(cnt) len cnt if max_count > cnt[i]:
        break
     max_count > cnt[i] max_count cnt[i] cnt i break print(values[i]) print values[i] values i S = [input() for _ in range(N)] [input() for _ in range(N)] S max_count = cnt[0] cnt[0] max_count N = int(input()) int(input()) N values, cnt = zip(*ans.most_common()) zip(*ans.most_common()) values cnt = zip(*ans.most_common()) zip(*ans.most_common()) cnt ans = collections.Counter(S) collections.Counter(S) ans
import collections

N = int(input())
S = [input() for _ in range(N)]
S.sort()
#print(S)
ans = collections.Counter(S)
values, cnt = zip(*ans.most_common())
#print(values)
#print(cnt)
max_count = cnt[0]
for i in range(len(cnt)):
    if max_count > cnt[i]:
        break
    print(values[i])