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

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

题意：有n个颜色的气球，就是求哪张颜色气球最多，并且输出来这个颜色即可。

思路：我是开了一个二维数组，将这些字符串都存在这个二维数组里面，两层两层for循环计算每个颜色出现的次数，将出现次数最多的字符串复制到字符数组t里面，最后输出即可。代码如下：

#include<stdio.h>
#include<string.h>
int main()
{
    int i,j,n,maxx;
    int num[1010];
    char a[1000][10];
    char t[10];
    while(~scanf("%d",&n)&&n)
    {
        maxx=-1;
        memset(num,0,sizeof(num));
        for(i=0; i<n; i++)
            scanf("%s",a[i]);//存在数组里面
        for(i=0; i<n; i++)
        {
            for(j=0; j<n; j++)
            {
                if(strcmp(a[i],a[j])==0)//字符串比较函数
                {
                    num[i]++;
                }
            }
        }
        for(i=0; i<n; i++)
        {
            if(num[i]>maxx)
            {
                maxx=num[i];
                strcpy(t,a[i]);//复制到t内
            }
        }
        printf("%s\n",t);
    }
    return 0;
}