#include <bits/stdc++.h>
int main(void) {
  int n, i, subx, suby, dis;
  int t[100000] = {0}, x[100000] = {0}, y[100000] = {0};
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d %d %d", &t[i], &x[i], &y[i]);
  }
  for (i = 0; i < n; i++) {
    subx = x[i + 1] >= x[i] ? x[i + 1] - x[i] : x[i] - x[i + 1];
    suby = y[i + 1] >= y[i] ? y[i + 1] - y[i] : y[i] - y[i + 1];
    dis = subx + suby;
    if (dis > t[i + 1] - t[i] || dis % 2 != (t[i + 1] - t[i]) % 2) {
      printf("No");
      return 0;
    }
  }
  printf("Yes");
  return 0;
}
