CodeForces 888A Local Extrema

Description：

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.

Example

Input

3
1 2 3

Output

0

Input

4
1 5 2 5

Output

2

题目大意：

给定一个数组， 它定义的局部极值为最大/小值为当前这个数字比左右临近数字都要大/小， 现在让你统计共有多少个局部极值。

解题思路：

对于第一个数字和最后一个数字一定是不为局部极值的， 所以我们从第二个数字开始遍历到第n-1个， 其中如果有满足条件的数字的话就统计上， 最后输出总数即可。

代码：

#include <iostream>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <utility>
#include <string>
#include <cmath>
#include <vector>
#include <bitset>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>

using namespace std;

/*
 *ios::sync_with_stdio(false);
 */

typedef long long ll;
typedef unsigned long long ull;
const int dir[5][2] = {0, 1, 0, -1, 1, 0, -1, 0, 0, 0};
const ll ll_inf = 0x7fffffff;
const int inf = 0x3f3f3f;
const int mod = 1000000;
const int Max = (int) 1e6;

int n;
int arr[Max];

int main() {
    int cnt = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &arr[i]);
    }
    for (int i = 1; i < n - 1; ++i) {
        if (arr[i - 1] < arr[i] && arr[i + 1] < arr[i])
            cnt++;
        else if (arr[i - 1] > arr[i] && arr[i + 1] > arr[i])
            cnt++;
    }
    printf("%d\n", cnt);
    return 0;
}