n = int(input())
d = []
for i in range(n):
a = input()
d+=[a]
s = 0
w = 0
t = [ ]
for j in d:
t+=[d.index(j)]
for k in t:
if k == 0:
s+=1
elif k > 0:
w +=1
if s > w:
l = t.index(0)
print(d[l])
elif w > s:
v = t.index(max(t))
print(d[v])
1486A - Shifting Stacks | 1389B - Array Walk |
71B - Progress Bar | 701A - Cards |
545A - Toy Cars | 1538E - Funny Substrings |
234A - Lefthanders and Righthanders | 1611D - Weights Assignment For Tree Edges |
197A - Plate Game | 1474A - Puzzle From the Future |
6B - President's Office | 1405B - Array Cancellation |
431C - k-Tree | 101A - Homework |
1642C - Great Sequence | 1523B - Lord of the Values |
1406C - Link Cut Centroids | 2409. Count Days Spent Together |
2410. Maximum Matching of Players With Trainers | 1604C - Di-visible Confusion |
997A - Convert to Ones | 218A - Mountain Scenery |
486B - OR in Matrix | 1405A - Permutation Forgery |
1733A - Consecutive Sum | 1733B - Rule of League |
1733C - Parity Shuffle Sorting | 1264A - Beautiful Regional Contest |
1695A - Subrectangle Guess | 467B - Fedor and New Game |