package he011101;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner reader = new Scanner(System.in);
while(reader.hasNext()){
int N = reader.nextInt();
int[] L = new int[N];
for(int i=0;i<L.length;i++){
L[i]=reader.nextInt();
}
int[] left = new int[L.length];
int[] right = new int[L.length];
int MAX = 0;
left[0]=1;
for(int i=1;i<L.length;i++){
left[i]=1;
for(int j=0;j<i;j++){
if(L[j]<L[i] && left[j]>left[i]-1){
left[i] = left[j]+1;
}
}
}
right[L.length-1] = 1;
for(int i=L.length-2;i>=0;i--){
right[i] = 1;
for(int j=L.length-1;j>i;j--){
if(L[i]>L[j] && right[j]+1>right[i]){
right[i] = right[j]+1;
}
}
}
for(int i=0;i<L.length;i++){
if(left[i]+right[i]>MAX){
MAX = left[i]+right[i];
}
}
System.out.println(L.length-MAX+1);
}
reader.close();
}
}