n = int(input())
heights = list(map(int, input().split()))
dp_a = [1] * (n+1)
dp_b = [1] * (n+1)
res = 0
for i in range(n):
for j in range(i):
if heights[j] < heights[i]:
dp_a[i] = max(dp_a[i], dp_a[j]+1)
for i in range(n-1, -1, -1):
for j in range(i+1, n):
if heights[j] < heights[i]:
dp_b[i] = max(dp_b[i], dp_b[j]+1)
res = max(res, dp_b[i]+dp_a[i]-1)
print(n-res)