#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+10;
int arr[N];

int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>arr[i];
    int ans=1;
    for(int i=2,sign=0;i<=n;i++){
        if(arr[i]>arr[i-1])if(sign!=-1)sign=1;else ans++,sign=0;
        if(arr[i]<arr[i-1])if(sign!=1)sign=-1;else ans++,sign=0;
    }
    cout<<ans;


}

### Prompt

Your task is to create 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+10;
int arr[N];

int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>arr[i];
    int ans=1;
    for(int i=2,sign=0;i<=n;i++){
        if(arr[i]>arr[i-1])if(sign!=-1)sign=1;else ans++,sign=0;
        if(arr[i]<arr[i-1])if(sign!=1)sign=-1;else ans++,sign=0;
    }
    cout<<ans;


}

```