#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    vector<int> heights(n);
    for (int i = 0; i < n; ++i) {
        cin >> heights[i];
    }
    vector<int> inc(n, 1);  
    vector<int> dec(n, 1); 
    for (int i = 1; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            if (heights[i] > heights[j]) {
                inc[i] = max(inc[i], inc[j] + 1);
            }
        }
    }
    for (int i = n - 2; i >= 0; --i) {
        for (int j = i + 1; j < n; ++j) {
            if (heights[i] > heights[j]) {
                dec[i] = max(dec[i], dec[j] + 1);
            }
        }
    }
    int max_length = 0;
    for (int i = 0; i < n; ++i) {
        max_length = max(max_length, inc[i] + dec[i] - 1);
    }
    int min_out = n - max_length;
    cout << min_out << endl;
}
/**************************************************************
	Problem: 1277
	User: linlinzi
	Language: C++
	Result: Accepted
	Time:40 ms
	Memory:2076 kb
****************************************************************/