int* sta(int arr[],int n)
{
	int* p1 = arr;
	int i, j;
	int str1[1000];
	for (j = 0;j < n;j++)
	{
		int count = 0;

		int* p2 = arr + (n - 1);
		for (i = 0;p2 >= arr;i++)
		{
			if (*p1 == *p2)
			{
				count++;
			}
			str1[j] = count;
			p2--;
		}
		p1++;
	}
	return str1;
}

int* sort(int arr[],int n)
{
	int* str2 = arr;;
	int i, j;
	for (i = 0;i < n - 1;i++)
	{
		int* p3 = str2;
		for (j = 0;j < n - 1 - i;j++)
		{
			if (*p3 > *(p3 + 1))
			{
				int tmp = *p3;
				*p3 = *(p3 + 1);
				*(p3 + 1) = tmp;
			}
			p3++;
		}
	}
	return str2;
}
int main()
{
	int n,i,j;
	scanf("%d", &n);
	int arr[1000] = { 0 };
	int* ret1;
	int* ret2;
	for (i = 0;i < n;i++)
	{
		scanf("%d",&arr[i]);
	}
		 ret2 = sort(arr,n);
		 ret1 = sta(ret2, n);
		 int* p4 = ret2;
		 for (i = 0;i < n;i++)
		 {
			 if (*p4 == *(p4 + 1))
			 {
				 ;
			 }
			 else
			 {
				 printf("%d %d\n", *ret2, *ret1);
			 }
			 ret2++;
			 ret1++;
			 p4++;
		 }
	return 0;
}