#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;

int main() {
    int N;
    cin >> N;
    vector<int> arr(N);
    for (int i = 0; i < N; ++i) {
        cin >> arr[i];
    }

    unordered_map<int, int> pos;
    for (int i = 0; i < N; ++i) {
        pos[arr[i]] = i;
    }

    int max_sorted_len = 0;
    int current = 1;

    while (current <= N && pos[current] > pos[current - 1]) {
        max_sorted_len++;
        current++;
    }

    cout << N - max_sorted_len << endl;
    return 0;
}