Let the Balloon Rise（https://acs.jxnu.edu.cn/problem/HDU1004/editor）

题目：

Let the Balloon Rise

描述：

Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.

This year, they decide to leave this lovely job to you.

输入：

Input contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.

A test case with N = 0 terminates the input and this test case is not to be processed.

输出：

For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.

样例输入：

5
green
red
blue
red
red
3
pink
orange
pink
0

样例输出：

red
pink

翻译：

描述：

测试的时间又到了！看到气球漂浮起来是很兴奋的事，但是告诉你一个秘密，裁判最喜欢的时间是猜测最流行的问题，当测试结束的时候，他们将数出每种颜色的气球并且找出结果。

这一年，他们决定把这个可爱的工作留给你。

输入：

输入包含多组测试用例，每个测试用例以一个数N (0 < N <= 1000)开始--分发的气球总数，接下来的N行包含每一种颜色，气球的颜色是一个小于15个小写字母的字符串。

N = 0 的测试用例终止输入并且这个测试用例不被处理。

输出：

对于每个测试用例，在单个的一行中输出最流行问题的气球颜色，保证对每个测试用例有唯一的解。