#include <cstdio>
#include <cstdlib>
#include <map>
#include <vector>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=111;
class Lunwen
{
	public:string name;int lnum,H;
	int lw[MAXN]; vector<int>pos;
	Lunwen(){name.clear();lnum=0;
	memset(lw,0,sizeof(lw));pos.clear();}
}E[MAXN];int N;
map<string,int> hash;
int author[MAXN],top=0;

inline void init()
{
	cin>>N;string name;
	for(int i=1;i<=N;i++)
	{
		cin>>name;
		if(!hash[name]) {
			hash[name]=++top;E[top].name=name;}
		author[i]=hash[name];
		E[author[i]].pos.push_back(i);
	} char c;
	for(int i=1;i<=N;i++)
	{
		for(int j=1;j<=N;j++)
		{
			c=0;while(c!='0'&&c!='1')cin>>c;
			if(c=='1') E[author[j]].lnum++,
				E[author[j]].lw[j]++;
		}
	}
}

inline bool check(int an,int h)
{
	if(h>int(E[an].pos.size())) return 0;
	int tmpda=0,tmpde=0;
	for(unsigned int i=0;i<E[an].pos.size();i++)
	{
		if(E[an].lw[E[an].pos[i]]>h) tmpda++;
		if(E[an].lw[E[an].pos[i]]==h) tmpde++;
	}
	if(tmpda>h) return 0;
	return ((tmpda+tmpde)>=h);
}

bool cmp(Lunwen a,Lunwen b)
{
	if(a.H!=b.H) return a.H>b.H;
	return a.name<b.name;
}

int main()
{
	freopen("publish.in","r",stdin);
	freopen("publish.out","w",stdout);
	init();
	for(int i=1;i<=top;i++)
	{
		E[i].H=0;
		for(int j=0;j<=E[i].lnum;j++)
			if(check(i,j)) E[i].H=j;
	}
	sort(E+1,E+1+top,cmp);
	for(int i=1;i<=top;i++)
		cout<<E[i].name<<" "<<E[i].H<<endl;
	return 0;
}