#include <cstdio>

int g[120000];
int i,j,n,t;

int main()
{
	scanf("%d",&n);
	for (i=1;i<=n;i++)
		scanf("%d",&g[i]);
	for (i=1;i<=n;i=j+1,t++)
	{
		for (j=i;(j<=n) && (g[i]==g[j]);j++);
		if (g[i]>g[j]) for (;(j<=n) && (g[j+1]<=g[j]);j++);
		else for (;(j<=n) && (g[j+1]>=g[j]);j++);
	}
	printf("%d",t);
	return 0;
}
### Prompt

Please formulate 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>

int g[120000];
int i,j,n,t;

int main()
{
	scanf("%d",&n);
	for (i=1;i<=n;i++)
		scanf("%d",&g[i]);
	for (i=1;i<=n;i=j+1,t++)
	{
		for (j=i;(j<=n) && (g[i]==g[j]);j++);
		if (g[i]>g[j]) for (;(j<=n) && (g[j+1]<=g[j]);j++);
		else for (;(j<=n) && (g[j+1]>=g[j]);j++);
	}
	printf("%d",t);
	return 0;
}
```