(* O(n) *)
let solve n infos =
  let rec loop (t', x', y') = function
  | [] -> "Yes"
  | (t, x, y) :: rest ->
    let min_time = (x - x') + (y - y') in
    let needed_time = t - t' in
    if needed_time < min_time || (needed_time - min_time) mod 2 <> 0 then (* ∵ 格子点の偶奇性より *)
      "No"
    else 
      loop (t, x, y) rest
  in
    loop (0, 0, 0) infos

(* O(n) *)
let fold_int f a n =
  let rec fold f a i n =
    if i >= n then
      a
    else
      fold f (f a i) (i + 1) n
  in
    fold f a 0 n

let read_ints () = read_line () |> Str.split (Str.regexp " ") |> List.map int_of_string

let _ =
  let n = read_int () in
  fold_int
    (fun sofar _ ->
      match read_ints () with
      | [t; x; y] -> (t, x, y) :: sofar
      | _ -> sofar)
    []
    n |> List.rev |> solve n |> print_endline