#include <bits/stdc++.h>
int main() {
  int N;
  int i;
  int flag;
  int dt, dist;
  int t[110000], x[110000], y[110000];
  scanf("%d", &N);
  t[0] = x[0] = y[0] = 0;
  for (i = 0; i < N; i++) {
    scanf("%d%d%d", &t[i + 1], &x[i + 1], &y[i + 1]);
  }
  flag = 0;
  for (i = 0; i < N; i++) {
    dt = t[i + 1] - t[i];
    if (x[i + 1] > x[i]) {
      dist = x[i + 1] - x[i];
    } else {
      dist = x[i] - x[i + 1];
    }
    if (y[i + 1] > y[i]) {
      dist += (y[i + 1] - y[i]);
    } else {
      dist += (y[i] - y[i + 1]);
    }
    if (dt >= dist) {
      if ((dt - dist) % 2 == 0) {
        flag = 1;
      } else {
        flag = 0;
        break;
      }
    }
  }
  if (flag == 1) {
    printf("Yes");
  } else {
    printf("No");
  }
  return 0;
}
