题解 | #合唱队#

def func(list):
    dp = [1]*len(list)
    for i in range(len(list)):
        for j in range(i):
            if list[i] > list[j]:
                dp[i] = max(dp[i], dp[j]+1)
    return dp


count = int(input())
heights = list(map(int, input().split()))
left = func(heights)
right = func(heights[::-1])[::-1]
res = []
for i in range(count):
    res.append(left[i] + right[i]-1)

print(count-max(res))