import collections
n = int(input())
c = collections.Counter([ input() for i in range(n) ])
ma = max(c.values())
print(*sorted([ i for i, j in c.items() if j == ma ]), sep='\n') import collections collections n = int(input()) n int(input()) int input() input input() for i in range(n) for i in range(n) i range(n) range n for i in range(n) input() input c = collections.Counter([ input() for i in range(n) ]) c collections.Counter([ input() for i in range(n) ]) collections.Counter collections Counter [ input() for i in range(n) ] ma = max(c.values()) ma max(c.values()) max c.values() c.values c values i for i, j in c.items() if j == ma for i, j in c.items() if j == ma i j c.items() c.items c items j == ma j ma if j == ma i print(*sorted([ i for i, j in c.items() if j == ma ]), sep='\n') print *sorted([ i for i, j in c.items() if j == ma ]) sorted([ i for i, j in c.items() if j == ma ]) sorted [ i for i, j in c.items() if j == ma ] sep='\n' sep '\n' n = int(input()) int(input()) n ma = max(c.values()) max(c.values()) ma c = collections.Counter([ input() for i in range(n) ]) collections.Counter([ input() for i in range(n) ]) c
import collections
n = int(input())
c = collections.Counter([ input() for i in range(n) ])
ma = max(c.values())
print(*sorted([ i for i, j in c.items() if j == ma ]), sep='\n')