//2008B Dennis
//How:  sort names, go through the list and note the longest "run" of each name so far.  Record name and maxcount.
//At the end, print out your result
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;

int main()
{
	int n;
	string names[2500];
	while (cin>>n && n!=0)
	{
		for (int i=0;i<n;i++) cin>>names[i];
		sort(names,names+n);

		//finds "longest run" sequence
		string previous="",current,maxname=names[0];
		int count,max=1;
		for (int i=0;i<n;i++)
		{
			current=names[i];
			if (previous.compare(current)==0)
			{
				count++;
				if (max<count) max=count,maxname=current;
			}
			else count=1;
			previous=current;
		}
		cout<<maxname<<" "<<max<<endl;
	}
	return 0;
}