#include <bits/stdc++.h>

int sign(int x) {
	return (x > 0) - (x < 0);
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);

	int n; std::cin >> n;
	int ans = 0, t = 0, last = -1;
	for (int i = 0; i < n; ++ i) {
		int x; std::cin >> x;
		if (!i || (sign(x - last) * t == -1)) {
			++ ans; t = 0;
		}
		else if (!t && sign(x - last)) {
			t = sign(x - last);
		}
		last = x;
	}

	std::cout << ans << std::endl;
}
### Prompt

Construct a CPP code solution to the problem outlined:

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 <bits/stdc++.h>

int sign(int x) {
	return (x > 0) - (x < 0);
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);

	int n; std::cin >> n;
	int ans = 0, t = 0, last = -1;
	for (int i = 0; i < n; ++ i) {
		int x; std::cin >> x;
		if (!i || (sign(x - last) * t == -1)) {
			++ ans; t = 0;
		}
		else if (!t && sign(x - last)) {
			t = sign(x - last);
		}
		last = x;
	}

	std::cout << ans << std::endl;
}
```