import std.stdio;
import std.algorithm;
import std.array;
import std.conv;
import std.string;
import std.math;

void main() {
  int N;
  N = readln.chomp.to!int;

  auto s = [0, 0, 0];
  bool is_reach = true;

  for (int i = 0; i < N; ++i) {
    auto g = readln.chomp.split.map!(to!int).array;
    int t = g[0] - s[0], dist = abs(g[1] - s[1]) + abs(g[2] - s[2]);

    if (!(t >= dist && (t - dist) % 2 == 0)) {
      is_reach = false;
    }

    s = g;
  }

  if (is_reach) {
    writeln("Yes");
  }
  else {
    writeln("No");
  }

  return;
}