import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;
class InputReader{
private final InputStream stream;
private final byte[] buf=new byte[800000];
private int curChar,snumChars;
public InputReader(InputStream st) {
this.stream=st;
}
public int read() {
if(snumChars==-1)
throw new InputMismatchException();
if(curChar>=snumChars) {
curChar=0;
try {
snumChars=stream.read(buf);
}catch (IOException e) {
// TODO: handle exception
throw new InputMismatchException();
}
if(snumChars<=0)
return -1;
}
return buf[curChar++];
}
public int nextInt() {
int c=read();
while(isSpaceChar(c)) {
c=read();
}
int sgn=1;
if(c=='-') {
sgn=-1;
c=read();
}
int res=0;
do {
res*=10;
res+=c-'0';
c=read();
}while(!isSpaceChar(c));
return res*sgn;
}
public long nextLong() {
int c=read();
while(isSpaceChar(c)) {
c=read();
}
int sgn=1;
if(c=='-') {
sgn=-1;
c=read();
}
int res=0;
do {
res*=10;
res+=c-'0';
c=read();
}while(!isSpaceChar(c));
return res*sgn;
}
public int[] nextIntArray(int n) {
int a[]=new int[n];
for(int i=0;i<n;i++) {
a[i]=nextInt();
}
return a;
}
public String readString() {
int c=read();
while(isSpaceChar(c)) {
c=read();
}
StringBuilder res=new StringBuilder();
do {
res.appendCodePoint(c);
c=read();
}while(!isSpaceChar(c));
return res.toString();
}
public String nextLine() {
int c=read();
while(isSpaceChar(c)) {
c=read();
}
StringBuilder res=new StringBuilder();
do {
res.appendCodePoint(c);
c=read();
}while(!isEndOfLine(c));
return res.toString();
}
private boolean isEndOfLine(int c) {
// TODO Auto-generated method stub
return c=='\n'||c=='\r'||c==-1;
}
private boolean isSpaceChar(int c) {
// TODO Auto-generated method stub
return c==' '||c=='\n'||c=='\r'||c=='\t'||c==-1;
}
}
public class Main{
static int N=100100;
public static void main(String arg[]) throws IOException{
InputReader in=new InputReader(System.in);
int n;
int i,j,res;
int[] a=new int[N];
int[] dp=new int[N];
n=in.nextInt();
for(i=0;i<n;i++)a[i]=in.nextInt();
for(i=0;i<n;i++) {
res=1;
dp[i]=1;
for(j=0;j<i;j++) {
if(a[j]<a[i]) {
dp[i]=Math.max(dp[i],1+dp[j]);
}
}
}
res=0;
for(i=0;i<n;i++)res=Math.max(res,dp[i]);
System.out.println(n-res);
}
}
tle5个数据求助