import Control.Monad

main = do
  n <- read <$> getLine
  xs <- forM [1..n] $ \t -> do
    (a:b:c:xs) <- map read . words <$> getLine
    return (a,b,c)
  putStrLn $ if solve ((0,0,0):xs) then "Yes" else "No"

solve :: [(Int,Int,Int)] -> Bool
solve (x:[]) = True
solve all@((t1,x1,y1):(t2,x2,y2):xs) = 
  let dt = t2 - t1
      dist = (abs (x2-x1)) + (abs (y2-y1))
  in if dt >= dist && (dt-dist) `mod` 2 == 0 then
    solve (tail all)
  else
    False
