#include <cstdio>
#include <algorithm>
#include <vector>
#include <climits>

#define f first
#define s second

using namespace std;

long long v[100010];

int main ()
{
 //   freopen ("file.in", "r", stdin);

    int n;
    scanf ("%d", &n);

    v[0] = LLONG_MAX;
    int nr = 1, rez = 0;
    for (int i = 1; i <= n; ++i)
        scanf ("%lld", &v[i]);


    for (int i = 10; i <= n - 9; ++i)
    {
        bool OK = true;

        for (int j = i - 1; j >= i - 9 && OK; --j)
            if (v[j] > v[j + 1]) OK = false;

        for (int j = i + 1; j <= i + 9 && OK; ++j)
            if (v[j - 1] < v[j]) OK = false;

        if (OK) ++rez;
    }

    printf ("%d\n", rez);

    return 0;
}