#include <bits/stdc++.h>
using namespace std;
int n, a[105], p[105], q[105], f[105];
int ans = INT_MAX;

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	for (int i = 2; i <= n; i++)
		for (int j = 1; j < i; j++)
			if (a[j] < a[i] && p[j] + 1 >= p[i])
				p[i] = p[j] + 1;
	for (int i = n - 1; i >= 1; i--)
		for (int j = i + 1; j <= n; j++)
			if (a[j] < a[i] && q[j] + 1 >= q[i])
				q[i] = q[j] + 1;
	for (int i = 1; i <= n; i++)
		f[i] = n - (p[i] + q[i] - 1);
	for (int i = 1; i <= n; i++)
		ans = min(ans, f[i]);
	cout << ans;
	return 0;
}