#include<iostream>
#include<algorithm>
using namespace std;
int n,a[10008],mx,l,s;
int main()
{
cin>>n;
for (int i=1;i<=n;i++){
cin>>a[i];
if (a[i]>mx) {mx=a[i];l=i;}
}
for (int i=l+1;i<=n;i++)
if (a[i]<a[i-1]) s++;
else break;
cout<<s+1<<endl;
return 0;
}