/*
By Tianyi Chen. All rights reserved.
Date: 2017-04-15
*/
#include<bits/stdc++.h>
using namespace std;
int n,ans=1,a[100001],inc;
int main(){
 scanf("%d",&n);for(int i=0;i<n;++i)scanf("%d",a+i);
 inc=a[1]>a[0]?1:a[1]<a[0]?-1:0;
 for(int i=2;i<n;++i){
  if(inc==1&&a[i]<a[i-1]||inc==-1&&a[i]>a[i-1])++ans,inc=0;
  else if(a[i]!=a[i-1])inc=a[i]>a[i-1]?1:-1;
 }
 printf("%d\n",ans);
}
### 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
/*
By Tianyi Chen. All rights reserved.
Date: 2017-04-15
*/
#include<bits/stdc++.h>
using namespace std;
int n,ans=1,a[100001],inc;
int main(){
 scanf("%d",&n);for(int i=0;i<n;++i)scanf("%d",a+i);
 inc=a[1]>a[0]?1:a[1]<a[0]?-1:0;
 for(int i=2;i<n;++i){
  if(inc==1&&a[i]<a[i-1]||inc==-1&&a[i]>a[i-1])++ans,inc=0;
  else if(a[i]!=a[i-1])inc=a[i]>a[i-1]?1:-1;
 }
 printf("%d\n",ans);
}
```