#include <bits/stdc++.h>
int main(void) {
  int N, X, Y, n, i, k, j, l, m, di, tim;
  scanf("%d", &N);
  n = N + 1;
  int x[100000];
  int t[100000];
  int y[100000];
  int dis[100000];
  int time[100000];
  x[0] = 0;
  y[0] = 0;
  t[0] = 0;
  for (i = 1; i <= n - 1; i++) {
    scanf("%d%d%d", &t[i], &x[i], &y[i]);
  }
  for (k = 0; k <= n - 2; k++) {
    if (x[k + 1] >= x[k]) {
      X = x[k + 1] - x[k];
    } else {
      X = x[k] - x[k + 1];
    }
    if (y[k + 1] >= y[k]) {
      Y = y[k + 1] - y[k];
    } else {
      Y = y[k] - y[k + 1];
    }
    dis[k] = X + Y;
    time[k] = t[k + 1] - t[k];
    if (dis[k] < 0) {
      dis[k] = -1 * dis[k];
    }
    if (time[k] < 0) {
      time[k] = -1 * time[k];
    }
    di = dis[k] % 2;
    tim = time[k] % 2;
    if (di != tim || dis[k] > time[k]) {
      printf("No");
      break;
    }
  }
  if (di == tim && dis[k] <= time[k]) {
    printf("Yes");
  }
  return 0;
}
