import std.stdio,
       std.string,
       std.conv,
       std.algorithm;

int abs(int x) {
  return (x >= 0) ? x : -x;
}

void main() {
  int N = readln.chomp.to!(int);
  int[][] a;
  for (int i = 0; i < N; i++) {
    a ~= readln.chomp.split.to!(int[]);
  }

  bool f = true;
  int t = 0, x = 0, y = 0;
  for (int i = 0; i < N; i++) {
    int dt = abs(a[i][0] - x), dx = a[i][1] - x, dy = a[i][2] - y;
    int d = abs(dx) + abs(dy);
    f = d <= dt && (d - dt) % 2 == 0;
    if (!f) {
      break;
    }
  }
  writeln(f ? "Yes" : "No");
}
