Problem:
Score : 300 points

Problem Statement

You are given an array A of length N.
Your task is to divide it into several contiguous subarrays.
Here, all subarrays obtained must be sorted in either non-decreasing or non-increasing order.
At least how many subarrays do you need to divide A into?

Constraints

1 \leq N \leq 10^5

1 \leq A_i \leq 10^9

Each A_i is an integer.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the minimum possible number of subarrays after division of A.

Sample Input 1

6
1 2 3 2 2 1

Sample Output 1

2

One optimal solution is to divide the array into [1,2,3] and [2,2,1].

Sample Input 2

9
1 2 1 2 1 2 1 2 1

Sample Output 2

5

Sample Input 3

7
1 2 3 2 1 999999999 1000000000

Sample Output 3

3

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <string.h>

typedef long long ll;
using namespace std;
const ll INF = 1000000000000000000ll;
const ll MOD = 1000000007ll;

const double EPS = 1e-8;

int main()
{
	ll N;

	ll d,dtem,ans=0;

	int H=0;

	cin >> N;
	vector<int> a(N,0);

	for(int i=0;i<N;i++){
		cin >> a[i];
	}

	for(int i=0;i<N-2;++i){
		if(i>N){break;}
		d=a[i+1]-a[i];
		dtem=a[i+2]-a[i+1];
		if(d<0 && dtem>0){
			ans++;
			i++;
		}else if(d>0 && dtem<0){
			ans++;
			i++;
		}else{
			
		}
	}


	cout << ans+1 << endl;
	return 0;
}