b162 zerojude

#include<stdio.h>
#include<stdlib.h>
int cmp(const void *a,const void *b)
{
    int x=*(int *)a;
    int y=*(int *)b;
    return (x<y?-1:x>y?1:0);
}
int main()
{
    int number[200005],n,i;
    int count=0;
    while(~scanf("%d",&n))
    {
        for(i=0;i<n;i++) scanf("%d",&number[i]);
        qsort(number,i,4,cmp);
        number[n]=-1;
        for(i=0;i<n;i++)
        {
            count++;
            if(number[i]!=number[i+1])
            {
                printf("%d %d\n",number[i],count);
                count=0;
            }
        }
    }
    return 0;
}