#include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <sstream>
//#include <iterator>
//#include <iomanip>

using namespace std;
using ll = unsigned long long;

typedef pair<ll, ll> P;
map<int,int> dp;
vector<int> X;
vector<int> Y;
vector<int> Z;

int main(void){
    string a;
    getline(cin, a);
    string lineF;
    getline(cin, lineF);
    vector<int> N;
    istringstream iss(lineF);
    int k;
    int mx=0;
    int num=0;
    int maxnum;
    while(iss >>k){
        N.push_back(k);
        mx=max(mx,k);
        if(mx==k){
            maxnum=num;
        }
        num++;
    }
    int ans=num-maxnum-1;
    for(int k=maxnum;k>=0;k--){
        if(N[k]==N[maxnum]-1){
            ans+=maxnum-k-1;
            maxnum = k;
        }
    }
    cout << ans+maxnum <<endl;

}