#include <iostream>
using namespace std;
#define rep(i,q) for(int i = 0; (q) > i; i++)
int main(){
  int n;cin>>n;
  int now = 0;//1=zoka;
  int a[n];
  int kekka = 0;
  rep(i,n)cin >> a[i];
  for(int i = 1; n > i; i++){
    if(a[i-1] < a[i]){
      if(now == 0 || now == 1)now=1;
      else kekka++,now=0;
    }else if(a[i-1] > a[i]){
      if(now == 0 || now == 2)now=2;
      else kekka++,now=0;
    }
  }
  cout << kekka+1 << endl;
}
### Prompt

Generate 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 <iostream>
using namespace std;
#define rep(i,q) for(int i = 0; (q) > i; i++)
int main(){
  int n;cin>>n;
  int now = 0;//1=zoka;
  int a[n];
  int kekka = 0;
  rep(i,n)cin >> a[i];
  for(int i = 1; n > i; i++){
    if(a[i-1] < a[i]){
      if(now == 0 || now == 1)now=1;
      else kekka++,now=0;
    }else if(a[i-1] > a[i]){
      if(now == 0 || now == 2)now=2;
      else kekka++,now=0;
    }
  }
  cout << kekka+1 << endl;
}
```