Problem:
Score : 300 points

Problem Statement

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.

Sample Input 1

6
1 2 3 2 2 1

Sample Output 1

2

One optimal solution is to divide the array into [1,2,3] and [2,2,1].

Sample Input 2

9
1 2 1 2 1 2 1 2 1

Sample Output 2

5

Sample Input 3

7
1 2 3 2 1 999999999 1000000000

Sample Output 3

3

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.IOException;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) throws IOException{
		SortedArrays solver = new SortedArrays();
		solver.readInput();
		solver.solve();
		solver.writeOutput();
	}


	static class SortedArrays {

		private int n;
		private int a[];

		private Scanner scanner;
		private int output;

		public SortedArrays() {
			scanner = new Scanner(System.in);
			output = 2;
		}

		public void readInput() {
			int buff;
			n = Integer.parseInt(scanner.next());
			a = new int[n];

			for(int i=0;i<n;i++) {
				a[i] = Integer.parseInt(scanner.next());
			}

		}

		public void solve() {
			int slope=0;
			for(int i=0; i<n-1; i++) {

				if(slope == 0) {
					if(a[i]<a[i+1]) {
						slope = 1;
					} if(a[i]>a[i+1]) {
						slope = -1;
					} else {
						slope = 0;
					}
				} else if(slope == 1) {
					if(a[i]>a[i+1]) {
						slope = 0;
						output++;
					}
				} else if(slope == -1) {
					if(a[i]<a[i+1]) {
						slope = 0;
						output++;
					}
				}





			}

		}
		public void writeOutput() {
			System.out.println(output);
		}
	}

}