program cch(input,output,f1,f2);
var
 f1,f2:text;
 i,n,x,c:longint;
 a:array[1..200000] of longint;

procedure qsort(l,r:integer);
var
 i,j,temp:integer;
begin
 i:=l; j:=r;
 x:=a[l];
 repeat
  while a[j]>x do dec(j);
  while a[i]<x do inc(i);
  if i<=j then begin
    temp:=a[i]; a[i]:=a[j]; a[j]:=temp;
    inc(i); dec(j);
   end;
 until i>j;
 if i<r then qsort(i,r);
 if j>l then qsort(l,j);
end;


begin
 assign(f1,'pcount.in');
 assign(f2,'pcount.out');
 reset(f1);
 rewrite(f2);
 readln(f1,n);
 for i:=1 to n do readln(f1,a[i]);
 qsort(1,n);
 i:=1;
 while i<=n do begin
  x:=a[i]; c:=0;
  while (i<=n)and(x=a[i]) do begin
   inc(i); inc(c);
  end;
  writeln(f2,x,' ',c);
 end;
 close(f1);
 close(f2);
end.