#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=n;i++)
#define rep2(i,k,n) for(int i=k;i>=n;i--)
using namespace std;
typedef long long ll;
typedef double db;
const int N=1e5+7;
int a[N],n;
int main(){
	scanf("%d",&n);
	rep(i,1,n)scanf("%d",&a[i]);
	int op=0,ne=0,kk=1,now=a[1];
	rep(i,2,n)if(a[i]!=a[i-1]){
		if(a[i]>now)ne=1;
		else ne=2;
		if(!op)op=ne;
		else if(op!=ne){
			kk++;
			op=0;
		}
		now=a[i];
	}
	printf("%d\n",kk);
}
### Prompt

Your task is to create 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>
#define rep(i,k,n) for(int i=k;i<=n;i++)
#define rep2(i,k,n) for(int i=k;i>=n;i--)
using namespace std;
typedef long long ll;
typedef double db;
const int N=1e5+7;
int a[N],n;
int main(){
	scanf("%d",&n);
	rep(i,1,n)scanf("%d",&a[i]);
	int op=0,ne=0,kk=1,now=a[1];
	rep(i,2,n)if(a[i]!=a[i-1]){
		if(a[i]>now)ne=1;
		else ne=2;
		if(!op)op=ne;
		else if(op!=ne){
			kk++;
			op=0;
		}
		now=a[i];
	}
	printf("%d\n",kk);
}
```