#include <bits/stdc++.h>
using namespace std;
int N;
int T[100001], X[100001], Y[10001];
bool ans = true;
int main(void) {
  T[0] = X[0] = Y[0] = 0;
  for (int n = 1; n <= N; ++n) cin >> T[n] >> X[n] >> Y[n];
  for (int n = 0; n <= N - 1; ++n) {
    int dt = T[n + 1] - T[n];
    int dx = abs(X[n + 1] - X[n]);
    int dy = abs(Y[n + 1] - Y[n]);
    bool no = (dt < dx + dy) || ((dt % 2) ^ ((dx + dy) % 2));
    if (no) {
      ans = false;
      break;
    }
  }
  if (ans) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}
