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 = input()
  A = input().split()
  AD = True
  EF = True
  ANS = 0
  
  for i in range(0,int(N)):
  	if i >= 1:
  		if A[i] >= A[i-1] and AD == False and EF == False:
  			EF = True
  			ANS += 1
  		elif A[i] <= A[i-1] and AD == True and EF == False:
  			EF = True
  			ANS += 1
  		if EF == True:
  			if A[i] >= A[i-1]:
  				AD = True
  				EF = False
  			elif A[i] =< A[i-1]:
  				AD = False
  				EF = False
  
  print(ANS)
  
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"}]