#include<iostream>
#include<vector>
using namespace std;

int main(){
	int n;
	cin>>n;
	
	vector<int>p(n,0);
	
	int f=0, cnt=1;
	
	for(int i=0;i<n;i++){
		cin>>p[i];
	}
	
	for(int i=0;i<n-1;i++){
		if(p[i]<p[i+1]){
			if(f==0){
				f=1;
			}
			else if(f==2){
				cnt++;
				f=0;
			}
		}
		else if(p[i]>p[i+1]){
			if(f==0){
				f=2;
			}
			else if(f==1){
				cnt++;				
				f=0;
			}
		}
	}
	cout<<cnt<<endl;
	return 0;
}
### 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<iostream>
#include<vector>
using namespace std;

int main(){
	int n;
	cin>>n;
	
	vector<int>p(n,0);
	
	int f=0, cnt=1;
	
	for(int i=0;i<n;i++){
		cin>>p[i];
	}
	
	for(int i=0;i<n-1;i++){
		if(p[i]<p[i+1]){
			if(f==0){
				f=1;
			}
			else if(f==2){
				cnt++;
				f=0;
			}
		}
		else if(p[i]>p[i+1]){
			if(f==0){
				f=2;
			}
			else if(f==1){
				cnt++;				
				f=0;
			}
		}
	}
	cout<<cnt<<endl;
	return 0;
}
```