Sorting Railway

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<30)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
#define IN(n) int n; cin >> n;
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define PR(A,X) (X?A.second:A.first)
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1<<17)
int X,T[MX],D[MX];
int main(void){
    IN(N)ga(N,T+1);
    FT(1,N+1)X=max(X,D[T[k]]=1+D[T[k]-1]);
    printf("%d\n",N-X);
    return 0;
}