#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
using namespace std;

const int maxn=1e5+5;

int n,a[maxn];

int main()
{
	int ans=1, s=0;
	
	scanf("%d",&n);
	fo(i,1,n)
	{
		scanf("%d",&a[i]);
		if (i==1) continue;
		
		if (a[i]<a[i-1]) s|=1;
			else if (a[i]>a[i-1]) s|=2;
		if (s==3)
		{
			ans++;
			s=0;
		}
	}
	
	printf("%d\n",ans);
}
### Prompt

Develop a solution in Cpp to the problem described below:

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>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
using namespace std;

const int maxn=1e5+5;

int n,a[maxn];

int main()
{
	int ans=1, s=0;
	
	scanf("%d",&n);
	fo(i,1,n)
	{
		scanf("%d",&a[i]);
		if (i==1) continue;
		
		if (a[i]<a[i-1]) s|=1;
			else if (a[i]>a[i-1]) s|=2;
		if (s==3)
		{
			ans++;
			s=0;
		}
	}
	
	printf("%d\n",ans);
}
```