题解 | #合唱队#

# 20240912
def f(lst):
    dp = [1]*len(lst)  # 注意这里
    for i in range(len(lst)):
        for j in range(i):
            if lst[i] > lst[j]:
                dp[i] = max(dp[i],dp[j]+1)
    return dp
N = int(input())
ls = list(map(int,input().split()))
dp1 = f(ls)
dp2 = f(ls[::-1])[::-1]
max = 0     # 初始化
for i in range(N):
    if max < dp1[i] + dp2[i] - 1:
        max = dp1[i] + dp2[i] - 1
print(N-max)