#include <iostream>
//#include<fstream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
//ifstream cin("date.in");
//ofstream cout("date.out");
#define maxn 101

long long a[100002],b[100002],v[100002],i,j,n,m,nr;
char x;

int main()
{
    cin>>n;
    for(i=1;i<=n;i++){
        cin>>v[i];
    }
    for(i=2;i<=n;i++){
        if(v[i]>v[i-1]){
            a[i]=a[i-1]+1;
        }
    }
    for(i=n-1;i>0;i--){
        if(v[i]>v[i+1]){
            b[i]=b[i+1]+1;
        }
    }
    for(i=1;i<=n;i++){
        if(a[i]==9 && b[i]==9){
            nr++;
        }
    }
    cout<<nr;
    return 0;
}