#include <cstdio>

#include <algorithm>

using namespace std;

int a[200010];

int main()

{

int many;

cin>>many;

for (int i=1; i<=many; i++)

scanf ("%d",&a[i]);

sort (a+1,a+many+1);

int s=1;

for (int i=1; i<=many; i++)

if (a[i]==a[i+1]) s++;

else

{

printf ("%d %d\n",a[i],s);

s=1;

}

return 0;

}