program mountain;

const
    MAXN = 100000;

var
    ANS, N, i, j, lung : LongInt;
    P         : Array of LongInt;

begin

   (* assign(input,  'input.txt');  reset(input);
    assign(output, 'output.txt'); rewrite(output);*)

    ReadLn(N);
    SetLength(P,N);
    for i:=0 to N-1 do
        Read(P[i]);
    ReadLn();

    ANS := 0;

    i:=1;
    lung:=N;
    while i<lung-1 do
          begin
            if (P[i]<P[i-1]) and (P[i]<P[i+1]) then 
                                                begin
                                                  ANS:=ANS+1;
                                                  for j:=i to lung-2 do begin P[j]:=P[j+1]; write(P[j],' '); end;
                                                  writeln;
                                                  lung:=lung-1;
                                                  SetLength(P,lung);
                                                  i:=i-1;
                                                end
                                               else i:=i+1;
          end;                                     
    WriteLn(ANS);
end.