#include #define nmax 100005 int n,v[nmax]; int solve(int i) { int j; for (j=i;j>=i-8;j--) if (!(v[j]>v[j-1])) return 0; for (j=i;j<=i+8;j++) if (!(v[j]>v[j+1])) return 0; return 1; } int main() { int i; // freopen("date.in","r",stdin); scanf("%d",&n); for (i=1;i<=n;i++) scanf("%d",&v[i]); int sol=0; for (i=10;i+9<=n;i++) sol+=solve(i); printf("%d",sol); return 0; }