from collections import Counter
N = int(input())
C = Counter([input() for _ in range(N)])
# print(f'{list(C)=}')

max_value = max([value for value in C.values()])
# print(f'{max_value=}')

S = [key for key, value in zip(C.keys(), C.values()) if value == max_value]
# print(f'{S=}')

for s in sorted(S):
    print(s) from collections import Counter 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 C = Counter([input() for _ in range(N)]) C Counter([input() for _ in range(N)]) Counter [input() for _ in range(N)] value for value in C.values() for value in C.values() value C.values() C.values C values for value in C.values() value max_value = max([value for value in C.values()]) max_value max([value for value in C.values()]) max [value for value in C.values()] key for key, value in zip(C.keys(), C.values()) if value == max_value for key, value in zip(C.keys(), C.values()) if value == max_value key value zip(C.keys(), C.values()) zip C.keys() C.keys C keys C.values() C.values C values value == max_value value max_value if value == max_value key S = [key for key, value in zip(C.keys(), C.values()) if value == max_value] S [key for key, value in zip(C.keys(), C.values()) if value == max_value] for s in sorted(S):
    print(s) s sorted(S) sorted S print(s) print s C = Counter([input() for _ in range(N)]) Counter([input() for _ in range(N)]) C N = int(input()) int(input()) N S = [key for key, value in zip(C.keys(), C.values()) if value == max_value] [key for key, value in zip(C.keys(), C.values()) if value == max_value] S max_value = max([value for value in C.values()]) max([value for value in C.values()]) max_value
from collections import Counter
N = int(input())
C = Counter([input() for _ in range(N)])
# print(f'{list(C)=}')

max_value = max([value for value in C.values()])
# print(f'{max_value=}')

S = [key for key, value in zip(C.keys(), C.values()) if value == max_value]
# print(f'{S=}')

for s in sorted(S):
    print(s)
