#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[105];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int left[105], right[105];
for (int i = 0; i < n; i++) {
left[i] = 1;
for (int j = 0; j < i; j++) {
if (a[j] < a[i]) {
left[i] = max(left[i], left[j] + 1);
}
}
}
for (int i = n-1; i >= 0; i--) {
right[i] = 1;
for (int j = n-1; j > i; j--) {
if (a[j] < a[i]) {
right[i] = max(right[i], right[j] + 1);
}
}
}
int max_len = 0;
for (int i = 0; i < n; i++) {
max_len = max(max_len, left[i] + right[i] - 1);
}
cout << n - max_len << endl;
return 0;
}
