//2008B Scott
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

class Name {
public:
	bool operator< (const Name & other);
	string name;
	int count;
};

bool Name::operator< (const Name & other)
{
	if (count > other.count)
		return true;
	else
		return false;
}

int Known(string key, vector<Name> names)
{
	for(int i = 0; i < names.size(); i++) {
		if(key == names[i].name)
			return i;
	}
	return -1;
 }

void GetNames(int & n, vector<Name> & names)
{
	Name name;
	int index;
	for (int i = 0; i < n; i++) {
		cin >> name.name;
		index = Known(name.name, names);
		if(index == -1) {
			name.count = 1;
			names.push_back(name);
		}
		else {
			names[index].count++;
			sort(names.begin(), names.end());
		}
	}
}

int main()
{
	int n;
	int index;
	vector<Name> names;
	cin >> n;
	while(n != 0) {
		names.clear();
		GetNames(n, names);
		cout << names[0].name << " " << names[0].count << endl;
		cin >> n;
	}

	return 0;
}