#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cmath>

 #include<queue>

 #include<stack>

 #include<map>

 #include<sstream>

 using namespace std;

 typedef long long ll;

 int dp1[], dp2[];

 double a[];

 int main()

 {

     int n;

     cin >> n;

     for(int i = ; i <= n; i++)cin >> a[i], dp1[i] = , dp2[i] = ;

     for(int i = ; i <= n; i++)

     {

         for(int j = ; j < i; j++)

             if(a[i]>a[j])dp1[i] = max(dp1[i], dp1[j] + );

     }

     for(int i = n; i >= ; i--)

     {

         for(int j = n; j > i; j--)

             if(a[i]>a[j])dp2[i] = max(dp2[i], dp2[j] + );

     }

     int ans = ;

     for(int i = ; i <= n; i++)

         for(int j = i + ; j <= n; j++)

         ans = max(dp1[i] + dp2[j], ans);

     cout<<n - ans<<endl;

 }