/*
TASK:psort
LANG:C++
*/

#include <stdio.h>
int N;
int p[40005];
int lns[40005];

int main ()
{ int i,j;
  int max=1,c;

  scanf("%d",&N);
  scanf("%d",&p[1]);
  lns[1]=1;
  for(i=2;i<=N;i++)
    { scanf("%d",&p[i]);
      c=0;
      for(j=1;j<i;j++)
        if ((p[i]>p[j])&&(c<lns[j])) c=lns[j];
      lns[i]=c+1;
      if (max<lns[i]) max=lns[i];
    }
  printf("%d\n",N-max);
  return 0;

}

