#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <sstream>
#include <iostream>
#include <fstream>
#include <functional>
#include <cmath>
#include <ctime>
#include <cstring>
#include <algorithm>
#include <windows.h>

#pragma warning( disable: 4996 )

using namespace std;

typedef unsigned long long ull;

template<typename T> inline T sqr(T a) { return a*a; }
template<typename T> inline int size(const T& c) { return (int)c.size(); }

#define zero(a) memset( &a, 0, sizeof(a) )

//#define printf
//#define DBG
//#define VERIFY
#define ERR         -1

#define INF         1000000

int n;
vector<int> a, b;

int main() {

    FILE *fin = fopen("seq.in", "r");
    FILE *fout = fopen("seq.out", "w+");
    int i, x, idx = 0;

    fscanf( fin, "%d", &n);

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

        fscanf( fin, "%d", &x );
        a.push_back( x );
        b.push_back( x );
    }

    sort( b.begin(), b.end() );

    
    for ( i = 0; i < n; i++ )
        if ( a[ i ] == b[ idx ] ) idx++;

    fprintf( fout, "%d", n - idx );

    return 0;
}