p03745 AtCoder Grand Contest 013 - Sorted Arrays_17016
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
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; i++){
            a[i] = sc.nextInt();
        }
        boolean plus = true;
        int ans = 1;
        int prev = 0;
        boolean isFirst = true, isSecond = false, isZero = false;
        for(int i = 0; i < n; i++){
            if(isFirst){
                isFirst = false;
                isSecond = true;
            }else if(isSecond || isZero){
                isSecond = false;
                if(a[i-1] == a[i]){
                    isZero = true;
                }else{
                    isZero = false;
                    plus = a[i-1] < a[i] ? true : false;
                }
            }else if(plus && prev > a[i]){
                ans++;
                isSecond = true;
            }else if(!plus && prev < a[i]){
                ans++;
                isSecond = true;
            }
            prev = a[i];
        }
        System.out.println(ans);
    }
}
