#include <iostream>
using namespace std;

int updown(int i, int j){
    if(i<j) return 1;
    if(i>j) return 0;
}
int main() {
	int N; cin >> N;
	int A[100010];
	for(int i=0; i<N; ++i) cin >> A[i];
	int P=1;
	int ud=2;
	for(int i=1; i<N; ++i){
	    if(A[i-1]!=A[i]){
	        if(ud!=2 && ud!=updown(A[i-1], A[i])){
	            ++P;
	            ud=2;
	        }
	        else ud=updown(A[i-1], A[i]);
	    }
	}
	cout << P << endl;
	return 0;
}

### Prompt

Please formulate 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 updown(int i, int j){
    if(i<j) return 1;
    if(i>j) return 0;
}
int main() {
	int N; cin >> N;
	int A[100010];
	for(int i=0; i<N; ++i) cin >> A[i];
	int P=1;
	int ud=2;
	for(int i=1; i<N; ++i){
	    if(A[i-1]!=A[i]){
	        if(ud!=2 && ud!=updown(A[i-1], A[i])){
	            ++P;
	            ud=2;
	        }
	        else ud=updown(A[i-1], A[i]);
	    }
	}
	cout << P << endl;
	return 0;
}

```