// RandomUsername (Nikola Jovanovic)
// MindCoding 2016 Round 3
// A

#include <bits/stdc++.h>
#define DBG false
#define debug(x) if(DBG) printf("(ln %d) %s = %d\n", __LINE__, #x, x);
#define lld long long
#define ff(i,a,b) for(int i=a; i<=b; i++)
#define fb(i,a,b) for(int i=a; i>=b; i--)
#define par pair<int, int>
#define fi first
#define se second
#define mid (l+r)/2
#define INF 1000000000
#define MAXN 100005

using namespace std;

int n;
int ret;
lld a[MAXN];

int main()
{
    scanf("%d", &n);
    ff(i, 1, n)
    {
        scanf("%lld", &a[i]);
    }
    ff(L, 10, n - 9)
    {
        bool ok = true;
        ff(i, L-9, L-1)
        {
            if(a[i] >= a[i+1]) ok = false;
        }
        ff(i, L, L+8)
        {
            if(a[i] <= a[i+1]) ok = false;
        }
        if(ok) ret++;
    }
    printf("%d\n", ret);
    return 0;
}