{"raw_statement":[{"iden":"problem statement","content":"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?"},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq A_i \\leq 10^9$\n*   Each $A_i$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$"},{"iden":"sample input 1","content":"6\n1 2 3 2 2 1"},{"iden":"sample output 1","content":"2\n\nOne optimal solution is to divide the array into $[1,2,3]$ and $[2,2,1]$."},{"iden":"sample input 2","content":"9\n1 2 1 2 1 2 1 2 1"},{"iden":"sample output 2","content":"5"},{"iden":"sample input 3","content":"7\n1 2 3 2 1 999999999 1000000000"},{"iden":"sample output 3","content":"3"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}