#include<iostream>
#include<algorithm>
using namespace std;
const int N = 110;
int n,h[N],f[N],g[N],i,j,ans=0;
int main()
{
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&h[i]);
for(i=1;i<=n;i++){
f[i]=1;
for(j=1;j<i;j++)if(h[j]<h[i])f[i]=max(f[i],f[j]+1);
}
for(i=n;i;i--){
g[i]=1;
for(j=n;j>i;j--)if(h[j]<h[i])g[i]=max(g[i],g[j]+1);
}
for(i=1;i<=n;i++)ans=max(ans,f[i]+g[i]-1);
printf("%d\n",n-ans);
return 0;
}