杭电1004

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.

Sample Input

5 green red blue red red 3 pink orange pink 0

Sample Output

red

pink

这道题主要是会用string类型数组，string本来就可以当成数组用，定义两个string数组，然后依次和后面一个数组比较，用对应的int数组来记录相同的string个数，最后在比较个数。题目有点难度，开始不知道要用string数组。代码如下：

#include 
#include 
using namespace std;
int main()
{
	string hk[1000],ls[1000];
	int a,b;
	while(cin>>a&&a!=0)
	{
		int c=0,lss[1000]={0},d=0;
		for(b=0;b>hk[b];
	
			ls[0]=hk[0];
			lss[0]=1;
					for(b=1;blss[d])
				d=b;
				cout<