A. Local Extrema / Educational Codeforces Round 32

A. Local Extrema


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



You are given an array a. Some element of this array ai is a local minimum iff it is strictly less than both of its neighbours (that is, ai < ai - 1and ai < ai + 1). Also the element can be called local maximum iff it is strictly greater than its neighbours (that is, ai > ai - 1 and ai > ai + 1). Since a1 and an have only one neighbour each, they are neither local minima nor local maxima.

An element is called a local extremum iff it is either local maximum or local minimum. Your task is to calculate the number of local extrema in the given array.



Input

The first line contains one integer n (1 ≤ n ≤ 1000) — the number of elements in array a.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the elements of array a.



Output

Print the number of local extrema in the given array.



Examples



input
3
1 2 3



output
0



input
4
1 5 2 5



output
2

#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
    long long n,a,b,i,c;
    long long ar[1000];
    while(cin>>n)
    {
        for(i=0; i<n; i++)
        {
            cin>>ar[i];
        }
        c=0;

        for(i=0; i<n; i++)
        {
            //cout<<ar[i]<<endl;
            if(i>0&&i<n-1)
            {
                if((ar[i]>ar[i-1]&&ar[i]>ar[i+1])||((ar[i]<ar[i-1]&&ar[i]<ar[i+1])))
                {
                    c++;
                    //cout<<ar[i]<<" "<<ar[i+1]<<" "<<ar[i-1]<<" "<<i<<endl;
                }
            }
        }
        cout<<c<<endl;
    }
    return 0;
}