#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
	long n, sum = 1; cin >> n;
	int j = 2;//1, 2, 3
	long long k;
	for (long i = 0; i < n; i++){
		long long a; cin >> a;
		if (i == 0);
		else if (j == 2) {
			if (k > a)j = 1;
			else if (k < a)j = 3;
		}
		else if (k < a&&j == 1) { j = 2; sum++; }
		else if (k > a&&j == 3) { j = 2; sum++; }
		k = a;
	}
	cout << sum << endl;
}
### Prompt

Please provide a CPP coded solution to the problem described below:

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.

Examples

Input

6
1 2 3 2 2 1


Output

2


Input

9
1 2 1 2 1 2 1 2 1


Output

5


Input

7
1 2 3 2 1 999999999 1000000000


Output

3

### Response

```cpp
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
	long n, sum = 1; cin >> n;
	int j = 2;//1, 2, 3
	long long k;
	for (long i = 0; i < n; i++){
		long long a; cin >> a;
		if (i == 0);
		else if (j == 2) {
			if (k > a)j = 1;
			else if (k < a)j = 3;
		}
		else if (k < a&&j == 1) { j = 2; sum++; }
		else if (k > a&&j == 3) { j = 2; sum++; }
		k = a;
	}
	cout << sum << endl;
}
```