#include<cstdio>
#include<algorithm>
#define rep(i,x,y) for(int i=(x);i<=(y);++i)
#define per(i,x,y) for(int i=(x);i>=(y);--i)
int n;
int main(){
	scanf("%d",&n);
	int lst=0,dir=0;
	int ans=1;
	rep(i,1,n){
		int x;scanf("%d",&x);
		if(dir==0){
			if(lst){
				if(lst<x)dir=1;
				if(lst>x)dir=-1;
			}
		}else{
			if((dir==1&&lst>x)||(dir==-1&&lst<x)){
				lst=0;++ans;dir=0;
			}
		}
		lst=x;
	}
	printf("%d",ans);
	return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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<cstdio>
#include<algorithm>
#define rep(i,x,y) for(int i=(x);i<=(y);++i)
#define per(i,x,y) for(int i=(x);i>=(y);--i)
int n;
int main(){
	scanf("%d",&n);
	int lst=0,dir=0;
	int ans=1;
	rep(i,1,n){
		int x;scanf("%d",&x);
		if(dir==0){
			if(lst){
				if(lst<x)dir=1;
				if(lst>x)dir=-1;
			}
		}else{
			if((dir==1&&lst>x)||(dir==-1&&lst<x)){
				lst=0;++ans;dir=0;
			}
		}
		lst=x;
	}
	printf("%d",ans);
	return 0;
}

```