#include <iostream>
using namespace std;

int dp1[105], dp2[105], a[105], n;

int main() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        dp1[i] = dp2[i] = 1;
    }
    for (int i = 2; i <= n; ++i) {
        for (int j = i - 1; j >= 1; --j) {
            if(a[i] > a[j]) dp1[i] = max(dp1[i], dp1[j] + 1);
        }
    }
    for (int i = n - 1; i >= 1; --i) {
        for (int j = i + 1; j <= n; ++j) {
            if(a[i] < a[j]) dp2[i] = max(dp2[i], dp2[j] + 1);
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        ans = max(ans, dp1[i] + dp2[i] - 1);
    }
    cout << n - ans;
    return 0;
}