#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

int pl[];

int main(){

    int n,m,i,j,k,ans=,len=;

    scanf("%d",&n);

    for(i=;i<=n;i++){

      scanf("%d",&k);

      pl[k]=i;

    }

    for(i=;i<n;i++)

      if(pl[i+]>pl[i])len++;

        else ans=max(ans,len),len=;

    ans=max(ans,len);

    cout<<n-ans<<"\n";

    return ;

}