/*
TASK:psort
LANG:C
*/

#include <stdio.h>

long p[50000], f[50000], n;

int main(void)
{
  long i, j;
  scanf("%ld", &n);
  for(i=0; i<n; ++i)
    scanf("%ld", &p[i]);
  f[0]=1;
  for(i=1; i<n; ++i)
  {
    f[i]=1;
    for(j=0; j<i; ++j)
      if(p[j]<p[i]&&f[j]>=f[i])
        f[i]=f[j]+1;
  }
  printf("%ld\n", n-f[n-1]);
  return 0;
}
