var

p,n,i,j,k,max1,max2,min:integer;

t,f:array[0..101]of integer;

begin

readln(n);

min:=1000;

for i:=1 to n do

read(t[i]);

for i:=2 to n-1 do

begin

for j:=0 to n+1 do

f[i]:=1;

for j:=2 to i-1 do

for k:=1 to j-1 do

if (t[k]f[j]) then

f[j]:=f[k]+1;

max1:=f[j];

f[i]:=1;

for j:=n-1 downto i do

for k:=n downto j+1 do

if (t[j]>t[k]) and (f[k]+1>f[j])

then f[j]:=f[k]+1;

if min>n-max1-f[j] then min:=n-max1-f[j];

end;

writeln(min);

end.

end.