Responsive image

问题 2063 --防AK.first

2063: 防AK.first

时间限制: 1 Sec  内存限制: 128 MB
提交: 45  解决: 29
[提交][状态][讨论版][命题人:]

题目描述

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

来源

杭电 

[提交][状态]
ACM算法攻关部