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 Ruby (2.7.1) (judge verdict: Wrong Answer)

n=gets.to_i
m=gets.split.map(&:to_i)
count=1
v=0
check=nil

for i in 0..m.length-1
   check_v=0
 p count

    if v==0
        v=m[i]
        
        if v>0
            check="+"
        elsif v<0
        check="-"
        end
        
       count+=1
      next
    end
    
    
    vv=m[i]-v
    if vv>0
        check_v="+"
    elsif vv<0
        check_v="-"
    else
        check_v=0
    end


    if check==check_v
        next
    else
       
       v=0
       check=0
    end
    
    
   
end
p count