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 Python (3.4.3) (judge verdict: Wrong Answer)

n = int(input())
a = list(map(int,input().split()))

flg=[]
for i in range(n-1):
    if a[i+1]>a[i]: flg.append(1)
    elif a[i+1]==a[i]: flg.append(0)
    else: flg.append(-1)

for i in range(len(flg)):
    if flg[i]==0:
        if 1<=i<=len(flg)-2:
            if flg[i-1]!=flg[i+1]:
                flg[i]=flg[i+1]
            else: flg[i]=int((flg[i+1]+flg[i-1])/2)
        elif i==0: flg[i]=flg[i+1]
        else: flg[i]=flg[i-1]

ans=1
skp=0
for i in range(len(flg)-1):
    if skp:
        skp=0
        continue
    if flg[i+1]!=flg[i]:
        ans+=1
        skp=1
print(ans)