program pcount;

type sz=array[1..1000]of longint;

var que:sz;
    i,n,ji:integer;
    tem:longint;
    f1:text;

procedure qs(var a:sz; lo,hi:Integer);
 procedure sort(l, r: Integer);
  var i, j, x, y: integer;
  begin
   i:=l;
   j:=r;
   x:=a[(l+r) div 2];
   repeat
    while a[i]<x do
     i:=i+1;

    while x<a[j] do
     j:=j-1;

    if i<=j then
    begin
     y:=a[i];
     a[i]:=a[j];
     a[j]:=y;
     i:=i+1;
     j:=j-1;
    end;
   until i>j;

   if l<j then Sort(l,j);
   if i<r then Sort(i,r);
  end;
 begin
  Sort(Lo,Hi);
 end;


begin
 assign(f1,'pcount.in');
 reset(f1);
 readln(f1,n);

 for i:=1 to n do
  read(f1,que[i]);

 qs(que,1,n);

 close(f1);

 assign(f1,'pcount.out');
 rewrite(f1);

 tem:=que[1]-1;
 ji:=1;

 for i:=1 to n do
  if tem<>que[i] then
  begin
   if i<>1 then
    writeln(f1,ji);
   write(f1,que[i],' ');
   tem:=que[i];
   ji:=1;
  end else inc(ji);

 writeln(f1,ji);

 close(f1);
end.