#include<bits/stdc++.h>
using namespace std;

int n,x,maxn;
unordered_map <int,int > p;

int main()
{
	cin >> n;
	for(int i = 1;i <= n;i++)
	{
		cin >> x;
		p[x] ++;
		maxn = max(maxn,x);
	}
	for(int i = 1;i <= maxn;i++)
	{
		if(p[i] != 0)
		{
			cout << i << " " << p[i] << endl;
		}
	}
	return 0;
}