Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
from collections import Counter
# input
n = int(input())
s = []
for i in range(n):
    s.append(input())
c = Counter(s)
# output
#ma = c.most_common()[0][1]
o = list(k for k, v in c.items() if v == c.most_common()[0][1])
#o = [k for k, v in c.items() if v == ma]
o.sort()
print('\n'.join(o))


Fixed submission:
# -*- coding: utf-8 -*-
from collections import Counter
# input
n = int(input())
s = []
for i in range(n):
    s.append(input())
c = Counter(s)
# output
ma = c.most_common()[0][1]
o = [k for k, v in c.items() if v == ma]
o.sort()
print('\n'.join(o))

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
from collections import Counter
# input
n = int(input())
s = []
for i in range(n):
    s.append(input())
c = Counter(s)
# output
#ma = c.most_common()[0][1]
o = list(k for k, v in s.items() if v == s.most_common()[0][1])
#o = [k for k, v in c.items() if v == ma]
o.sort()
print('\n'.join(o))


Fixed submission:
# -*- coding: utf-8 -*-
from collections import Counter
# input
n = int(input())
s = []
for i in range(n):
    s.append(input())
c = Counter(s)
# output
ma = c.most_common()[0][1]
o = [k for k, v in c.items() if v == ma]
o.sort()
print('\n'.join(o))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import collections
# input
n = int(input())
s = collections.Counter()
for i in range(n):
    s[input()] += 1
# print(s)
# output
# k = c.most_common()[0][1])
#out = collections.OrderedDict(k)
o = list(k for k, v in s.items() if v == s.most_common()[0][1])
for i in sorted(o):
    print(i)


Fixed submission:
# -*- coding: utf-8 -*-
from collections import Counter
# input
n = int(input())
s = []
for i in range(n):
    s.append(input())
c = Counter(s)
# output
ma = c.most_common()[0][1]
o = [k for k, v in c.items() if v == ma]
o.sort()
print('\n'.join(o))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import collections
# input
n = int(input())
s = []
for i in range(n):
    s.append(input())
c = collections.Counter(s)
# output
# print(c.most_common()[0][1])
# print(list(c))
o = list(k for k, v in c.items() if v == c.most_common()[0][1])
for i in sorted(o):
    print(i)


Fixed submission:
# -*- coding: utf-8 -*-
from collections import Counter
# input
n = int(input())
s = []
for i in range(n):
    s.append(input())
c = Counter(s)
# output
ma = c.most_common()[0][1]
o = [k for k, v in c.items() if v == ma]
o.sort()
print('\n'.join(o))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import collections
# input
n = int(input())
s = []
for i in range(n):
    s.append(input())
c = collections.Counter(s)
# output
# print(c.most_common()[0][1])
# print(list(c))
#print(sorted([k for k, v in c.items() if v == c.most_common()[0][1]]))
for i in sorted([k for k, v in c.items() if v == c.most_common()[0][1]]):
    print(i)


Fixed submission:
# -*- coding: utf-8 -*-
from collections import Counter
# input
n = int(input())
s = []
for i in range(n):
    s.append(input())
c = Counter(s)
# output
ma = c.most_common()[0][1]
o = [k for k, v in c.items() if v == ma]
o.sort()
print('\n'.join(o))