codeforces 888A题. Local Extrema

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 a_i is a local minimum iff it is strictly less than both of its neighbours (that is, a_i < a_i - 1 and a_i < a_i + 1). Also the element can be called local maximum iff it is strictly greater than its neighbours (that is, a_i > a_i - 1 and a_i > a_i + 1). Since a₁ and a_n 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 a₁, a₂, ..., a_n (1 ≤ a_i ≤ 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 <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std ;

int main() {
    int n ;
    int num[20000] ;
    while(~scanf("%d" , &n)) {
        
        for(int i=0 ; i<n ; i++) {
            scanf("%d" , &num[i]) ;
        }
        int result = 0 ;
        for(int i=1 ; i<n-1 ; i++) {
            if(num[i-1]<num[i] && num[i] > num[i+1]) {
                result ++ ;
            }
            if(num[i-1] > num[i] && num[i] < num[i+1]) {
                result ++ ;
            }
        }
        printf("%d
" , result) ;
        
    }
    
    return 0 ;
}