#include <bits/stdc++.h>
int main(void) {
  int n, i, lx, ly, len, ch;
  scanf("%d", &n);
  int t[n + 1], grid[n + 1][2];
  t[0] = 0;
  grid[0][0] = 0;
  grid[0][1] = 0;
  for (i = 1; i < n + 1; i++) {
    scanf("%d %d %d", &t[i], &grid[i][0], &grid[i][1]);
  }
  for (i = 0; i < n; i++) {
    lx = grid[i + 1][0] - grid[i][0];
    ly = grid[i + 1][1] - grid[i][1];
    if (lx < 0) lx = -lx;
    if (ly < 0) ly = -ly;
    len = lx + ly;
    ch = t[i + 1] - t[i] - len;
    if (ch < 0 || ch % 2 != 0) {
      printf("No\n");
      return 0;
    }
  }
  printf("Yes\n");
  return 0;
}
