#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
using namespace std;


const int N = 1e5 + 5;
int a[N];

int main()
{
    int n;
    cin >> n;
    for(int i = 0; i < n; ++i)
        scanf("%d", &a[i]);
    int ans = 0;
    for(int i = 0; i < n; ++i) {
        int j;
        for(j = 1; j <= 9; ++j) {
            if(i-j >= 0 && i+j < n && a[i-j] < a[i-j+1] && a[i+j] < a[i+j-1])
                continue;
            break;
        }
        ans += j == 10;
    }
    cout << ans << endl;
    
    return 0;
}