program ed; const n=15;
var a:array[1..n] of integer;
i,k,max:byte;
Begin writeln('vvedi znachenie elementov');
for i:=1 to n do readln(a[i]);
k:=0;
max:=0;
for i:=1 to n do if a[i]=0 then k:=k+1 else begin if k>max then max:=k;
k:=0;
end;
if k>max then max:=k;
writeln('dlinna maksimalnoi posledovatelnosti ravna',max);
readln;
End.