#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000000000000
using ll=long long;
using Graph=vector<vector<int>>;

int main(){
  int N;
  cin>>N;
  vector<pair<int,int>> A(N);
  for(int i=0;i<N;i++){
    cin>>A[i].first;
  }
  vector<pair<int,int>> B(N);
  for(int i=0;i<N;i++){
    B[i]=make_pair(A[i].first,i);
  }
  sort(B.begin(),B.end());
  for(int i=0;i<N;i++){
    A[B[i].second].second=i;
  }

  int k=N-1;
  for(int i=N-1;i>=0;i--){
    if(A[i].second==k){
      k--;
    }
  }
  cout<<k+1<<endl;
}