#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  int n;
  cin >> n;
  int ans = 1, c = 0, cur;
  cin >> cur;
  for (int i = 1; i < n; i++) {
    int nxt;
    cin >> nxt;
    if (nxt == cur) continue;
    if (1LL * c * (nxt - cur) < 0) {
      ans++;
      c = 0;
    } else {
      c = nxt - cur;
    }
    cur = nxt;
  }
  cout << ans << 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
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  int n;
  cin >> n;
  int ans = 1, c = 0, cur;
  cin >> cur;
  for (int i = 1; i < n; i++) {
    int nxt;
    cin >> nxt;
    if (nxt == cur) continue;
    if (1LL * c * (nxt - cur) < 0) {
      ans++;
      c = 0;
    } else {
      c = nxt - cur;
    }
    cur = nxt;
  }
  cout << ans << endl;
  return 0;	
}
```