{
TASK:psort
LANG:pascal
}
var
a,b:array [1..50000] of longint;
i,j,n,k,max,m:longint;
begin
 readln(n);
 for i:=1 to n do begin
  read(a[i]);
  b[i]:=a[i];
 end;
 j:=1;
 m:=1;
 max:=0;
 b[1]:=0;
 repeat
  k:=a[j];
  m:=1;
  for i:=j to n do
   if {(b[i]<>0) and} a[i]>k then begin inc(m); k:=a[i]; {b[i]:=0} end;
  if m>max then max:=m;
  m:=0;
 { i:=1;
  repeat
  inc(i);
  until (b[i]<>0) or (i>n);
  k:=a[i];
  b[i]:=0;}
  inc(j);
 until j>n;
 writeln(n-max);
end.