#include <iostream>
using namespace std;

int main() {
  int N;
  cin >> N;

  int cnt = 1;
  int sgn = 0;
  int lA;
  cin >> lA;
  for (int i = 1; i < N; i++) {
    int A;
    cin >> A;

    if (sgn == 0) {
      sgn = A > lA ? 1 : A < lA ? -1 : 0;
    }

    if (sgn == 1 && A < lA || sgn == -1 && A > lA) {
      sgn = 0;
      cnt++;
    }
    lA = A;
  }

  cout << cnt << endl;
  return 0;
}

### Prompt

Your challenge is to write 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;

int main() {
  int N;
  cin >> N;

  int cnt = 1;
  int sgn = 0;
  int lA;
  cin >> lA;
  for (int i = 1; i < N; i++) {
    int A;
    cin >> A;

    if (sgn == 0) {
      sgn = A > lA ? 1 : A < lA ? -1 : 0;
    }

    if (sgn == 1 && A < lA || sgn == -1 && A > lA) {
      sgn = 0;
      cnt++;
    }
    lA = A;
  }

  cout << cnt << endl;
  return 0;
}

```