#include <set>
#include <bitset>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#include <ios>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <complex>
#include <numeric>
#include <functional>
#include <cmath>
#include <ctime>
#include <climits>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cassert>
#define lson rt << 1, l, m
#define rson rt << 1 | 1, m + 1, r
using namespace std;
const int INF = 0x7FFFFFFF;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = 2 * acos (0.0);
const int maxn = 100 + 1666;
int n, dp1[maxn], dp2[maxn], ans[maxn];
int LIS ()
{
int maxval = -INF;
memset (dp1, 0, sizeof (dp1));
for (int i = 0; i < n; i++)
{
int tempmax = 0;
for (int j = 0; j < i; j++)
if (ans[i] > ans[j] && tempmax < dp1[j])
tempmax = dp1[j];
dp1[i] = tempmax + 1;
maxval = max (maxval, dp1[i]);
}
return maxval;
}
int LDS ()
{
int maxval = -INF;
memset (dp2, 0, sizeof (dp2));
for (int i = n - 1; i >= 0; i--)
{
int tempmax = 0;
for (int j = n - 1; j > i; j--)
if (ans[i] > ans[j] && tempmax < dp2[j])
tempmax = dp2[j];
dp2[i] = tempmax + 1;
maxval = max (maxval, dp2[i]);
}
return maxval;
}
int main()
{
// ifstream cin ("aaa.txt");
cin >> n;
for (int i = 0; i < n; i++)
cin>> ans[i];
LIS ();
LDS ();
int maxval = -INF;
for (int i = 0; i < n; i++)
maxval = max (maxval, dp1[i] + dp2[i] - 1);
cout << n - maxval << endl;
return 0;
}