//dennismv STL edition
#include <iostream>
#include <string>
#include <map>
using namespace std;
#define FOR(i,n) for (int i=0;i<n;i++)

//take this solution and shove it (into your expanding mind) ha ha ha
ostream& operator<<(ostream &os, const pair<string,int> &p){cout<<p.first<<" "<<p.second;return os;}
pair<string,int> getName(int n)
{
	map<string,int> table;
	string s,maxname;
	int max=0;
	FOR(i,n) cin>>s,max<++table[s]?max=table[s],maxname=s:s;
	return make_pair(maxname,max);
}

int main()
{
	int n;
	while (cin>>n && n!=0) cout<<getName(n)<<endl;
	return 0;
}