#include <iostream>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;
int main()
{
int N, qu[105];
int left[105], right[105];
left[0] = right[0] = 1;
scanf("%d", &N);
for (int i = 1; i <= N; i++){
scanf("%d", &qu[i]);
left[i] = right[i] = 1;
}
for (int i = 1; i <= N; i++){
for (int j = 1; j < i ; j++){
if (qu[j] < qu[i]) left[i] = max(left[i], left[j] + 1);
}
for (int k = N - i + 2; k <= N; k++){
if (qu[N - i + 1]>qu[k]) right[N - i + 1] = max(right[N - i + 1], right[k] + 1);
}
}
int ans = 0;
for (int i = 1; i <= N; i++){
ans = max(ans, left[i] + right[i] - 1);
}
printf("%d", N - ans);
return 0;
}