#include <map>
#include <string>
#include <iostream>

using namespace std;

int main()
{
    int n;
    while (cin >> n && n)
    {
        map<string, int> ma;
        map<string, int>::iterator it;
        map<string, int>::iterator mit;
        for (int i = 0; i < n; i ++ ) 
        {
            string str;
            cin >> str;
            it = ma.find(str);
            if (it == ma.end()) ma.insert(pair<string, int>(str, 1));
            else ma[str] ++ ;
        }
        int max = 0;
        for (it = ma.begin(); it != ma.end(); it ++ )
        {
            if (it -> second >= max) 
            {
                max = it -> second;
                mit = it;
            }
        }
        cout << mit -> first << endl;
    }
    return 0;
}