output_description: If AtCoDeer can carry out his plan, print `Yes`; if he cannot, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      t_1 x_1 y_1
      t_2 x_2 y_2
      :
      t_N x_N y_N
attempt: count = int(input())
  lis = [input() for i in range(count)]
  n = [-1] * count
  x = [-1] * count
  y = [-1] * count
  for i in range(len(lis)):
      n[i],x[i],y[i] =  map(int,lis[i].split())
  i = 0    
  n0 = 0
  x0 = 0
  y0 = 0 
  res = 1
  for i in range(len(n)):
      nt = n[i] - n0
      xt = x[i] - x0 
      yt = y[i] - y0
      if xt == 0 and yt == 0:
          res= -1
          break:
      elif xt + yt <= nt:
          if nt%2 == 0 and (xt+yt)%2 == 0:
  
              nt = n[i]
              xt = x[i]
              yt = y[i]
          elif nt%2 == 1 and (xt+yt)%2 == 1:
  
              nt = n[i]
              xt = x[i]
              yt = y[i]
          else:
   
              res = -1
              break
      else:
      
          res = -1
          break
  if res > 0:
      print("Yes")
  else:
      print("No")
problem_description: Statement
  
  AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan,
  he will depart from point (0, 0) at time 0, then for each i between 1 and N
  (inclusive), he will visit point (x_i,y_i) at time t_i.
  
  If AtCoDeer is at point (x, y) at time t, he can be at one of the following
  points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that **he
  cannot stay at his place**. Determine whether he can carry out his plan.
samples: [{"input": "2\n    3 1 2\n    6 1 1", "output": "Yes\n    \n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1),\n(1,0), then (1,1).\n\n* * *"}, {"input": "1\n    2 100 100", "output": "No\n    \n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\n* * *"}, {"input": "2\n    5 1 1\n    100 1 1", "output": "No"}]