#include<bits/stdc++.h>
#define int long long
const int inf=8938103643641919514ll;
const int mod=1000000007;
const int dd[]={0,-1,0,1,0};
using namespace std;
int a,b,c,d;
int p[100000];
signed main(){
	int i,j;
	cin>>a;
	for(i=0;i<a;i++)
		cin>>p[i];
	int u=p[0];
	int ans=1;
	int f=true,g=true;
	for(i=0;i<a;i++){
		if(u>p[i])
			g=false;
		if(u<p[i])
			f=false;
		if(!f&&!g){
			f=true;
			g=true;
			ans++;
		}
		u=p[i];
	}
	cout<<ans<<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>
#define int long long
const int inf=8938103643641919514ll;
const int mod=1000000007;
const int dd[]={0,-1,0,1,0};
using namespace std;
int a,b,c,d;
int p[100000];
signed main(){
	int i,j;
	cin>>a;
	for(i=0;i<a;i++)
		cin>>p[i];
	int u=p[0];
	int ans=1;
	int f=true,g=true;
	for(i=0;i<a;i++){
		if(u>p[i])
			g=false;
		if(u<p[i])
			f=false;
		if(!f&&!g){
			f=true;
			g=true;
			ans++;
		}
		u=p[i];
	}
	cout<<ans<<endl;
}
```