output_description: Print the minimum possible number of subarrays after division of A.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 ... A_N
attempt: N = int(input())
  Alist = list(map(int, input().split()))
  if N < 3:
      print(1)
  else:
      ans = 1
      last = Alist[0]
      new_a = [last]
      for i in range(N):
          now = Alist[i]
          if now != last:
              new_a.append(now)
          last = now
      now = "up" if new_a[0] < new_a[1] else "down
      f = now
      for i in range(1, len(new_a)):
          if new_a[i - 1] == new_a[i]:
              continue
          elif new_a[i - 1] < new_a[i]:
              if now == "down":
                  now = "up"
          elif new_a[i - 1] > new_a[i]:
              if now == "up":
                  now = "down"
          if now != f:
              ans += 1
          # print(i, now, ans)
      print(ans + 1)
problem_description: 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?
samples: [{"input": "6\n    1 2 3 2 2 1", "output": "2\n    \n\nOne optimal solution is to divide the array into [1,2,3] and [2,2,1].\n\n* * *"}, {"input": "9\n    1 2 1 2 1 2 1 2 1", "output": "5\n    \n\n* * *"}, {"input": "7\n    1 2 3 2 1 999999999 1000000000", "output": "3"}]