#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll x=0,n,last,sum=1;
inline void f(ll k){
	if(x==0){
		if(k>last)x=1;
		else if(k<last)x=2;
	}
	else{
		if(k>last&&x==2)sum++,x=0;
		else if(k<last&&x==1)sum++,x=0;
	}
}
int main(){
	register int i,j;
	scanf("%lld",&n);
	for(i=1;i<=n;i++){
		ll k;
		scanf("%lld",&k);
		if(i>1)f(k);
		last=k;
	}
	cout<<max(sum,(ll)1)<<endl;
	return 0;
}
### Prompt

Please create a solution in cpp 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 <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll x=0,n,last,sum=1;
inline void f(ll k){
	if(x==0){
		if(k>last)x=1;
		else if(k<last)x=2;
	}
	else{
		if(k>last&&x==2)sum++,x=0;
		else if(k<last&&x==1)sum++,x=0;
	}
}
int main(){
	register int i,j;
	scanf("%lld",&n);
	for(i=1;i<=n;i++){
		ll k;
		scanf("%lld",&k);
		if(i>1)f(k);
		last=k;
	}
	cout<<max(sum,(ll)1)<<endl;
	return 0;
}
```