#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>

using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
#define inf 100000000/*10^8*/
#define rep(i,l,r) for(int i=l;i<=r;i++)
const double EPS=1E-8;

////////////////////////////////////////


int main(){
    int n;cin>>n;
    int a[n];
    int pos=0;
    rep(i,0,n-1){
        cin>>a[i];
        if(a[i]==n)pos=i;
    }
    int ans=n-1;
    int k=n-1;
    rep(i,0,pos-1){
        if(a[pos-1-i]==k){
            ans--;
            k--;
        }
    }
    cout<<ans<<endl;
    return 0;
}