program heapsort;
var
  a:array[1..10001] of longint;
  i,j,temp,n,z:longint;
  fin,fout:text;

procedure init;
begin
  z:=1;
  read(fin,n);
  for i:=1 to n do
  begin
    readln(fin,a[i]);
  end;
end;
procedure qsort(s,t:longint);
var
  i,j,x:longint;
begin
  i:=s;
  j:=t;
  x:=a[(i+j)div 2];
  repeat
    while a[i]<x do inc(i);
    while a[j]>x do dec(j);
    if i<=j then
    begin
      temp:=a[i];
      a[i]:=a[j];
      a[j]:=temp;
      inc(i);dec(j);
    end;
  until i>j;
  if s<j then qsort(s,j);
  if i<t then qsort(i,t);
end;

begin
  assign(fin,'pcount.in');
  reset(fin);
  assign(fout,'pcount.out');
  rewrite(fout);

  init;
  qsort(1,n);
  for i:=1 to n do
  begin
    if i=1 then write(fout,a[i],' ');
    if (i<>1) and (a[i-1]=a[i]) then inc(z);
    if (i<>1) and (a[i-1]<>a[i]) then
    begin
      write(fout,z);
      writeln(fout);
      write(fout,a[i],' ');
      z:=1;
    end;
  end;
  write(fout,z);

  close(fin);
  close(fout);
end.