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 C++ (GCC 9.2.1) (judge verdict: Runtime Error)

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>

#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vector<int> ;
using vl = vector<ll>;

int main(){
    int n;
    cin >> n;

    vi a(n);
    rep(i,n) cin >> a[i];
    string s;
    rep(i,n-1){
        if(a[i] > a[i+1])  s += '>'; //cout << ">";
        else if(a[i] < a[i+1])  s += '<';//cout << "<";
        //else s+="="; //cout << "=";
    }
    int ans = 1;
    if(s.length() == 1){
        cout << 1 << endl;
        return 0;
        
    }
    rep(i,s.length()-1){
        if(s[i] == '>' && s[i+1] == '<'){ans++;
            i++;
        }
        else if(s[i] == '<' && s[i+1] == '>'){ans++;
        i++;
        }
    }

    cout << ans << endl;
    return 0;
}