#include<bits/stdc++.h>
using namespace std;
int main(){
  int n,a[100000],ans=1,t=2;
  cin>>n>>a[0];
  for(int i=1;i<n;i++){
    cin>>a[i];
    if(t==2&&a[i-1]<a[i])t=1;
    if(t==2&&a[i-1]>a[i])t=0;
    if(a[i-1]>a[i]&&t==1)ans++,t=2;
    if(a[i-1]<a[i]&&t==0)ans++,t=2;
  }
  cout<<ans<<endl;
  return 0;
}

### Prompt

Create a solution in CPP for 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>
using namespace std;
int main(){
  int n,a[100000],ans=1,t=2;
  cin>>n>>a[0];
  for(int i=1;i<n;i++){
    cin>>a[i];
    if(t==2&&a[i-1]<a[i])t=1;
    if(t==2&&a[i-1]>a[i])t=0;
    if(a[i-1]>a[i]&&t==1)ans++,t=2;
    if(a[i-1]<a[i]&&t==0)ans++,t=2;
  }
  cout<<ans<<endl;
  return 0;
}

```