hdu 1004 翻译

Problem Description

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

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.

 

Output

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.

翻译：

问题描述：

        比赛时间又一次开始，看到气球漂浮是多么令人兴奋啊！但是，要告诉你一个秘密，法官最喜欢的时间是猜测最受欢迎的问题。当测试结束后，他们将计数每一种颜色的气球，再找出结果。今年，他们决定把最“可爱”的问题留给你。

输入：

        输入多组测试用例，每个用例以一个数字N（0<N<=1000）开始（-----气球的个数），接下来的N行每行输入一种颜色，气球的颜色是字符少于15的单词。测试用例以N=0终止。

输出：

        对于每个案例，用一行打印出最受欢迎的气球的颜色。

友情提示：最受欢迎即出现次数最多。