uva10420

/*
** id :template
** author : swap_coder
** time:
*/


#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <cstdlib>
#include <stack>
using namespace std;

#define fi(i,a,b) for(int i=(int)a;i<=(int)b;i++)
#define fd(i,a,b) for(int i=(int)a;i>=(int)b;i--)
#define rep(i,n)  for(int i=0;i<n;i++)
#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define FILL(a,v) memset(a,v,sizeof(a))
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
#define INF (1<<29)
#define EPS 1e-9
#define PI acos(-1.0)
//stl
 #define sz(a) int((a).size())
 #define pb push_back
 #define all(c) ((c).begin(),(c).end())
 #define tr(c,i) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
 #define present(c,x) ((c).find(x) != (c).end())
 #define cpresent(c,x) (find(all(c),x) != (c).end())
 #define pf printf
 #define sf scanf


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii>    vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef map<string,int> msi;


struct C
{
    string c;
    int freq;

}a[2000+5];

bool mycmp (C x, C y)
{
    if ( x.c < y.c ) return true;
    return false;
}


int main()
{
    int t;
    cin>>t;
    getchar();
    msi mc;
    while(t--)
    {
        char input[2000];
        char country[75+5];
        gets(input);
        char tmp [75 + 5];
        strcpy (tmp, input);
        sscanf(input,"%s",country);

        mc[country]++;
    }
    int noofcountry=0;
    tr(mc,it)
    {
        a[noofcountry].c=(*it).first;
        a[noofcountry].freq=(*it).second;
        noofcountry++;
    }
    sort (a, a + noofcountry, mycmp);

    for ( int i = 0; i < noofcountry; i++ )
        cout << a [i].c << " " << a [i].freq << endl;

  return 0;
}