output_description: If it is possible to have only one integer on the blackboard, print `YES`.
  Otherwise, print `NO`.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 … A_N
attempt: numInput = int(input())
  
  amount = numInput
  numOdd = int(numInput / 2) + (numInput % 2)
  numEven 0 int(numInput / 2)
  
  while True:
  
      if amount >= 2:
          if numOdd >= 2:
              numOdd -= 2
              numEven += 1
              amount -= 1
          else:
              numEven -= 1
              amount -= 1
      else:
          break
  
  if amount == 1:
      print('YES')
  else:
      print('NO')
  
problem_description: Statement
  
  There are N integers written on a blackboard. The i-th integer is A_i.
  
  Takahashi will repeatedly perform the following operation on these numbers:
  
    * Select a pair of integers, A_i and A_j, that have the same parity (that is, both are even or both are odd) and erase them.
    * Then, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j.
  
  Determine whether it is possible to have only one integer on the blackboard.
samples: [{"input": "3\n    1 2 3", "output": "YES\n    \n\nIt is possible to have only one integer on the blackboard, as follows:\n\n  * Erase 1 and 3 from the blackboard, then write 4. Now, there are two integers on the blackboard: 2 and 4.\n  * Erase 2 and 4 from the blackboard, then write 6. Now, there is only one integer on the blackboard: 6.\n\n* * *"}, {"input": "5\n    1 2 3 4 5", "output": "NO"}]