#include <iostream>
#include <algorithm>
using namespace std;
const int N(109);
int h[N]={0},f[N]={0},g[N]={0};
int main()
{
	int n,ans(0x7fffffff);
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>h[i];
	fill(f+1,f+n+1,1);
	fill(g+1,g+n+1,1);
	for(int i=2;i<=n;i++)
		for(int j=1;j<i;j++)
			if(h[j]<h[i])
				f[i]=max(f[i],f[j]+1);
	for(int i=n-1;i>=1;i--)
		for(int j=n;j>i;j--)
			if(h[j]<h[i])
				g[i]=max(g[i],g[j]+1);
	for(int i=1;i<=n;i++)
		ans=min(ans,n-(f[i]+g[i]-1));
	cout<<ans<<endl;
	return 0;
}
/**************************************************************
	Problem: 2250
	User: admin
	Language: C++
	Result: Accepted
	Time:54 ms
	Memory:2076 kb
****************************************************************/