#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <cstdio>
#include <cstdlib>
using namespace std;
const int N=200000+250;
long long n,maxv=-1;
long long num[N],a[N],flag[N];

int main()
{
//freopen("D:\test\in.txt","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
flag[a[i]]=1;
num[a[i]]++;
maxv=max(maxv,a[i]);
}
for(long long i=1;i<=maxv;i++)
{
if(flag[i]==1) printf("%lld %lld\n",i,num[i]);
}
return 0;
}