{cel mai lung subsir crescator - afiseaza doar lungimea}
var v,L:array[1..100] of integer;
    k,i,n,mx,max:integer;
    f,g:text;
begin
        assign (f,'subsir.in');assign (g,'subsir.out');reset (f);
        rewrite (g); max:=0;
        read (f,n);
        for i:=1 to n do
                read (f,v[i]);
        L[n]:=1;
        for k:=n-1 downto 1 do begin
                mx:=0;
                for i:=k+1 to n do
                        if (v[i]>=v[k]) and (L[i]>mx) then
                                mx:=L[i];
                L[k]:=mx+1;
                if L[k]>max then
                        max:=L[k];end;
        writeln (g,max);
close (f);close(g);
end.