#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  int N, count = 1, judge = 0; cin >> N;
  ll A; cin >> A;
  for(int i = 0; i < N - 1; i++) {
    ll a; cin >> a;
    if(A == a) continue;
    if(judge) {
      if(judge * (A - a) > 0) {
        count++;
        judge = 0;
      }
      A = a;
    } else {
      judge = ((a > A) ? 1 : -1);
      A = a;
    }
  }
  cout << count << endl;
}
### Prompt

Please provide a CPP coded solution 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  int N, count = 1, judge = 0; cin >> N;
  ll A; cin >> A;
  for(int i = 0; i < N - 1; i++) {
    ll a; cin >> a;
    if(A == a) continue;
    if(judge) {
      if(judge * (A - a) > 0) {
        count++;
        judge = 0;
      }
      A = a;
    } else {
      judge = ((a > A) ? 1 : -1);
      A = a;
    }
  }
  cout << count << endl;
}
```