#include <stdio.h>

int main(void) {
  int i, j, k, ans = 1, n, now = 0, be, a, dis = 0;
  scanf("%d", &n);
  scanf("%d", &be);
  for(i = 1; i < n; ++i) {
    scanf("%d", &a);
    if(dis) {
      if((now && be > a) || (!now && be < a)) ++ans, dis = 0;
    } else {
      if(be < a) now = 1, dis = 1;
      if(be > a) now = 0, dis = 1;
    }
    be = a;
  }
  printf("%d", ans);
  return 0;
}
### Prompt

Develop a solution in cpp to the problem described below:

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 <stdio.h>

int main(void) {
  int i, j, k, ans = 1, n, now = 0, be, a, dis = 0;
  scanf("%d", &n);
  scanf("%d", &be);
  for(i = 1; i < n; ++i) {
    scanf("%d", &a);
    if(dis) {
      if((now && be > a) || (!now && be < a)) ++ans, dis = 0;
    } else {
      if(be < a) now = 1, dis = 1;
      if(be > a) now = 0, dis = 1;
    }
    be = a;
  }
  printf("%d", ans);
  return 0;
}
```