#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int n,f[101],len;
char m[101][21],w[101][101];
struct abc
{
	char name[21];
	int s[101],ans,sum[101];
	}p[101];
int cmp(const void *a,const void *b)
{
	struct abc *c=(struct abc *)a;
	struct abc *d=(struct abc *)b;
	if((c->ans)!=(d->ans)) return (d->ans)-(c->ans);
	return strcmp((c->name),(d->name));
	}
int main()
{
	FILE *in=fopen("publish.in","r");
	FILE *out=fopen("publish.out","w");
	int i,j,x;
	fscanf(in,"%d",&n);
	for(i=1;i<=n;i++)
		fscanf(in,"%s",m[i]);
	for(i=1;i<=n;i++)
	{
		for(j=i-1;j>=0;j++)
			if(strcmp(m[i],m[j])==0)
			{
				f[i]=f[j];
				break;
				}
		if(f[i]==0)
		{
			len++;
			strcpy(p[len].name,m[i]);
			f[i]=len;
			}	
		}
	for(i=1;i<=n;i++)
	{
		fscanf(in,"%s",w[i]);
		x=strlen(w[i]);
		for(j=0;j<x;j++)
		{
			if(w[i][j]=='1')//&&strcmp(m[j+1],m[i])!=0)
				p[f[j+1]].s[j+1]++;
			}
		}
	for(i=1;i<=len;i++)
	{
		for(j=1;j<=n;j++)
			p[i].sum[p[i].s[j]]++;
		for(j=0;j<=n;j++)
			if(p[i].sum[j]>=j) p[i].ans=j;
		}
	qsort(&p[1],len,sizeof(p[0]),cmp);	
	for(i=1;i<=len;i++)
		fprintf(out,"%s %d\n",p[i].name,p[i].ans);
	return 0;
	}