#include <bits/stdc++.h>
using namespace std;
int main() {
  int N;
  cin >> N;
  int t = 0;
  int x = 0;
  int y = 0;
  int able = 0;
  for (int i = 0; i < N; i++) {
    int ti, xi, yi;
    cin >> ti >> xi >> yi;
    int p = ti - t;
    int q = max(xi - x, x - xi);
    int r = max(yi - y, y - yi);
    int a = p % 2;
    int b = (q + r) % 2;
    if (p < q + r) {
      able = 1;
      break;
    } else if (a != b) {
      able = 1;
      break;
    }
    if (able) break;
    t += ti;
    x += xi;
    y += yi;
  }
  if (able == 0)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
