//
// main.cpp
// data structure
//
// Created by 戴志扬 on 16/9/7.
// Copyright © 2016年 sky.dai. All rights reserved.
//
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
vector<int>lettercount(26,0);
int main()
{
int n,i,index; //n组测试数据
char str[101];
cin>>n;
getchar();
while (n--)
{
gets(str);
unsigned long len = strlen(str);
for (index=0;index<len;index++)
{
if('a'<=str[index] && str[index]<='z')
str[index] = str[index]-'a'+'A';
}
for(index=0;index<len;index++)
{
if('A'<=str[index] && str[index]<='Z')
lettercount[str[index]-'A']++;
}
} //统计好各字母的count;
int max = 0;
for (i=0;i<26;++i)
{
if(lettercount[i]>max)
max = lettercount[i];
}
for (int j=max;j>0;j-- )
{
for(i=0;i<26;i++)
if(lettercount[i]==j)
printf("%c %d\n",'A'+i,lettercount[i]);
}
return 0;
}