n = int(input())
s = []
for i in range(n):
    s.append(input())
s.sort()
# print(s)
m = 1
cnt = [1]
ans = []
for i in range(1,n):
    if s[i] == s[i-1]:
        cnt[-1] += 1
    else:
        if cnt[-1] > m:
            ans = [s[i-1]]
        elif cnt[-1] == m:
            ans.append(s[i-1])
        m = max(m, cnt[-1])
        cnt.append(1)
    if i == n-1 and cnt[-1] > m:
        ans = [s[i]]
    elif i == n-1 and cnt[-1] == m:
        ans.append(s[i])
print('\n'.join(ans)) n = int(input()) n int(input()) int input() input s = [] s [] for i in range(n):
    s.append(input()) i range(n) range n s.append(input()) s.append s append input() input s.sort() s.sort s sort m = 1 m 1 cnt = [1] cnt [1] 1 ans = [] ans [] for i in range(1,n):
    if s[i] == s[i-1]:
        cnt[-1] += 1
    else:
        if cnt[-1] > m:
            ans = [s[i-1]]
        elif cnt[-1] == m:
            ans.append(s[i-1])
        m = max(m, cnt[-1])
        cnt.append(1)
    if i == n-1 and cnt[-1] > m:
        ans = [s[i]]
    elif i == n-1 and cnt[-1] == m:
        ans.append(s[i]) i range(1,n) range 1 n if s[i] == s[i-1]:
        cnt[-1] += 1
    else:
        if cnt[-1] > m:
            ans = [s[i-1]]
        elif cnt[-1] == m:
            ans.append(s[i-1])
        m = max(m, cnt[-1])
        cnt.append(1)
     s[i] == s[i-1] s[i] s i s[i-1] s i-1 i 1 cnt[-1] += 1 cnt[-1] cnt -1 1 if cnt[-1] > m:
            ans = [s[i-1]]
        elif cnt[-1] == m:
            ans.append(s[i-1])
         cnt[-1] > m cnt[-1] cnt -1 m ans = [s[i-1]] ans [s[i-1]] s[i-1] s i-1 i 1 elif cnt[-1] == m:
            ans.append(s[i-1])
         cnt[-1] == m cnt[-1] cnt -1 m ans.append(s[i-1]) ans.append ans append s[i-1] s i-1 i 1 m = max(m, cnt[-1]) m max(m, cnt[-1]) max m cnt[-1] cnt -1 cnt.append(1) cnt.append cnt append 1 if i == n-1 and cnt[-1] > m:
        ans = [s[i]]
    elif i == n-1 and cnt[-1] == m:
        ans.append(s[i]) i == n-1 and cnt[-1] > m i == n-1 i n-1 n 1 cnt[-1] > m cnt[-1] cnt -1 m ans = [s[i]] ans [s[i]] s[i] s i elif i == n-1 and cnt[-1] == m:
        ans.append(s[i]) i == n-1 and cnt[-1] == m i == n-1 i n-1 n 1 cnt[-1] == m cnt[-1] cnt -1 m ans.append(s[i]) ans.append ans append s[i] s i print('\n'.join(ans)) print '\n'.join(ans) '\n'.join '\n' join ans m = 1 1 m ans = [s[i]] [s[i]] ans ans = [s[i-1]] [s[i-1]] ans cnt = [1] [1] cnt ans = [] [] ans m = max(m, cnt[-1]) max(m, cnt[-1]) m n = int(input()) int(input()) n s = [] [] s
n = int(input())
s = []
for i in range(n):
    s.append(input())
s.sort()
# print(s)
m = 1
cnt = [1]
ans = []
for i in range(1,n):
    if s[i] == s[i-1]:
        cnt[-1] += 1
    else:
        if cnt[-1] > m:
            ans = [s[i-1]]
        elif cnt[-1] == m:
            ans.append(s[i-1])
        m = max(m, cnt[-1])
        cnt.append(1)
    if i == n-1 and cnt[-1] > m:
        ans = [s[i]]
    elif i == n-1 and cnt[-1] == m:
        ans.append(s[i])
print('\n'.join(ans))