#include <iostream>
#include <cstring>
using namespace std;
int pd[100010],arr[100010];
int main()
{
    int n,m,ans=0,T=0;
    memset(pd,0,sizeof(pd));
    cin>>n;
    
    for(int i=1;i<=n;i++)
    {
        cin>>arr[i];
    }

    T=arr[2]-arr[1];
    for (int i=3; i<=n; i++) {
        if(T==0)T=arr[i]-arr[i-1];
        if(1LL* T * (arr[i]-arr[i-1])<0){
            ans++;
            T=0;
        }
    }
    
    cout<<ans+1<<endl;
}
### Prompt

In CPP, your task is to solve 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 <cstring>
using namespace std;
int pd[100010],arr[100010];
int main()
{
    int n,m,ans=0,T=0;
    memset(pd,0,sizeof(pd));
    cin>>n;
    
    for(int i=1;i<=n;i++)
    {
        cin>>arr[i];
    }

    T=arr[2]-arr[1];
    for (int i=3; i<=n; i++) {
        if(T==0)T=arr[i]-arr[i-1];
        if(1LL* T * (arr[i]-arr[i-1])<0){
            ans++;
            T=0;
        }
    }
    
    cout<<ans+1<<endl;
}
```