#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int t[n + 1];
  int x[n + 1], y[n + 1];
  t[0] = 0;
  x[0] = 0;
  y[0] = 0;
  for (int k = 1; k <= n; k++) {
    cin >> t[k] >> x[k] >> y[k];
  }
  bool jud = true;
  for (int i = 0; i < n; i++) {
    if ((t[i + 1] - t[i] - abs(x[i + 1] - x[i]) - abs(y[i + 1] - y[i])) % 2 !=
            0 ||
        t[i + 1] - t[i] < (abs(x[i + 1] - x[i]) + abs(y[i + 1] - y[i]))) {
      jud = false;
      break;
    }
  }
  if (jud == true) {
    cout << "Yes";
  } else {
    cout << "No";
  }
  return 0;
}
