/*
TASK:psort
LANG:C++ 
*/
#include<iostream>
using namespace std;
long a[50002],T[50002],n,THE_BIG_MAX=0;

int main()
{
    cin>>n;
    long i,j;
    a[0]=0;T[0]=0;
    T[1]=1;
    for(i=1;i<=n;i++)
      {cin>>a[i];
      
                     int max=0;
                     for(j=1;j<i;j++)
                     if(a[i]>a[j]&&T[j]>max)max=T[j];
                     if(max+1>THE_BIG_MAX)THE_BIG_MAX=max+1;

      T[i]=max+1;
                     }





cout<<n-THE_BIG_MAX<<endl;
return 0;
}

