#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
#define Max 1500000001
int Num[Max], p[Max];
bool vis[Max];
int main()
{
    int N, x, k;
    while(cin>>N)
    {
        memset(Num, 0, sizeof(Num));
        memset(vis, false, sizeof(vis));
        k = 0;
        while(N--)
        {
            cin>>x;
            Num[x]++;
            if(vis[x]==false) 
            {
                p[k++] = x;
                vis[x] = true;
            }
        }
        sort(p, p+k);
        for(int i=0; i<k; i++)
            cout<<p[i]<<""<<Num[p[i]]<<endl;
    }
}

#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
map<int, int> vis;
vector<int> num;
int main()
{
    int N, x;
    while(scanf("%d", &N)==1)
    {
        vis.clear();
        num.clear();
        while(N--)
        {
            scanf("%d", &x);
            if(!vis[x])
            {
                num.push_back(x);
                vis[x]++;
            }
            else vis[x]++;
        }
        sort(num.begin(), num.end());
        int size = num.size();
        for(int i=0; i<size; i++)
            printf("%d %d\n", num[i], vis[num[i]]);
    }
}