#include <bits/stdc++.h>

using namespace std;
const int INF=1e9;
int h[1010],dp[1010];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;++i){
        scanf("%d",&h[i]);
    }
    /*int ans=-1e9;
    for(int i=n;i>=1;--i){
        for(int j=n+1;j>i;--j){
            if(h[j]<=h[i])
                dp[i]=max(dp[i],1+dp[j]);
        }
        ans=max(ans,dp[i]);
    }*/
    /*h[0]=1e9;
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < i; ++j) {
            if (h[j] >= h[i])
                dp[i] = max(dp[i], dp[j]+1);
        }
        ans = max(ans, dp[i]);
    }*/
    int ans=0;
    for (int i = 1; i <= n; ++i) {
        dp[i] = 1;
        for (int j = 1; j < i; ++j) {
            if (h[j] >= h[i])
                dp[i] = max(dp[i], dp[j]+1);
        }
        ans = max(ans, dp[i]);
    }
    printf("%d",n-ans);
    return 0;
}