#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;

const int N=1e5+10;

int n,a[N];

int main()
{
	scanf("%d",&n);
	int m=0;
	for(int i=1;i<=n;i++)
	{
		int x;
		scanf("%d",&x);
		if(!m||x!=a[m]) a[++m]=x;
	}
	int Ans=1;
	int opt=a[2]>a[1];
	for(int i=3;i<=m;i++)
	{
		if((a[i]>a[i-1])!=opt)
		{
			opt=a[i+1]>a[i];
			Ans++;
		}
	}
	cout<<Ans<<endl;
	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<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;

const int N=1e5+10;

int n,a[N];

int main()
{
	scanf("%d",&n);
	int m=0;
	for(int i=1;i<=n;i++)
	{
		int x;
		scanf("%d",&x);
		if(!m||x!=a[m]) a[++m]=x;
	}
	int Ans=1;
	int opt=a[2]>a[1];
	for(int i=3;i<=m;i++)
	{
		if((a[i]>a[i-1])!=opt)
		{
			opt=a[i+1]>a[i];
			Ans++;
		}
	}
	cout<<Ans<<endl;
	return 0;
}
	
```