#include<iomanip>
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<map>
#include<set>
#include<queue>
#include<algorithm>

using namespace std;

int sol, N, a[100009];

int main()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

scanf ("%d", &N), sol = 0;
for (int i=1; i<=N; i++)
    scanf ("%d", &a[i]);
for (int i=10; i<=N - 9; i++)
{
    bool ok = 1;
    for (int j=i - 9; j<i; j++)
        ok &= (a[j] < a[j + 1]);
    for (int j=i + 9; j>i; j--)
        ok &= (a[j] < a[j - 1]);
    if (ok) sol ++;
}
printf ("%d\n", sol);

return 0;
}