#include<cstdio>
using namespace std;
int n,ans;
int main(void){
	register int i,mx=-1,x,now,p;
	scanf("%d",&n);
	for(i=1;i<=n;++i){
		scanf("%d",&x);
		if(mx==-1)mx=x,p=1;
		else if(p==1){
			if(x>mx)mx=x,now=1,p=0;
			else if(x<mx)mx=x,now=0,p=0;
		}else{
			if(now==1){
				if(x>=mx)mx=x;
				else p=1,++ans,mx=x; 
			}
			else{
				if(x<=mx)mx=x;
				else p=1,++ans,mx=x;
			}
		}
	}
	printf("%d",ans+1);
	return 0;
}
### Prompt

Generate 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<cstdio>
using namespace std;
int n,ans;
int main(void){
	register int i,mx=-1,x,now,p;
	scanf("%d",&n);
	for(i=1;i<=n;++i){
		scanf("%d",&x);
		if(mx==-1)mx=x,p=1;
		else if(p==1){
			if(x>mx)mx=x,now=1,p=0;
			else if(x<mx)mx=x,now=0,p=0;
		}else{
			if(now==1){
				if(x>=mx)mx=x;
				else p=1,++ans,mx=x; 
			}
			else{
				if(x<=mx)mx=x;
				else p=1,++ans,mx=x;
			}
		}
	}
	printf("%d",ans+1);
	return 0;
}
```