# include <bits/stdc++.h>

using namespace std;

int x, last, flag = 0;
int main() {
	int n, m = 1; scanf("%d", &n);
	scanf("%d", &last);
	for(int i = 1; i < n; ++i) {
		scanf("%d", &x);
		if(x == last) continue;
		if((x > last && flag == -1) || (x < last && flag == 1)) {
			m++; flag = 0;
		} else {
			flag = x > last ? 1 : -1;
		}
		last = x;
	}
	printf("%d\n", m);
	return 0;
}

### Prompt

Your challenge is to write a Cpp solution to the following problem:

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>

using namespace std;

int x, last, flag = 0;
int main() {
	int n, m = 1; scanf("%d", &n);
	scanf("%d", &last);
	for(int i = 1; i < n; ++i) {
		scanf("%d", &x);
		if(x == last) continue;
		if((x > last && flag == -1) || (x < last && flag == 1)) {
			m++; flag = 0;
		} else {
			flag = x > last ? 1 : -1;
		}
		last = x;
	}
	printf("%d\n", m);
	return 0;
}

```