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

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

OutputFor 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

代码：

#include <iostream>

#include <cstdio>

#include <queue>

#include <map>

using namespace std;

int main()

{

    int n;

    string a,max="a";

    map<string,int> b;

    while(scanf("%d",&n)&&n)

    {

        b[max]=;

        for(int i=;i<=n;i++)

        {

            cin>>a;

            b[a]++;

            if(b[a]>b[max])max=a;

        }

        cout<<max<<endl;

    }

}