#include <bits/stdc++.h>
using namespace std;
int main() {
  int N;
  int t[100001];
  int x[100001];
  int y[100001];
  int dt;
  int dist;
  cin >> N;
  for (int i = 0; i < N; ++i) cin >> t[i] >> x[i] >> y[i];
  for (int i = 0; i < N; ++i) {
    dt = t[i + 1] - t[i];
    dist = abs(x[i + 1] - x[i]) + abs(y[i + 1] - y[i]);
    if (dist <= dt) {
      cout << "No" << endl;
      return 0;
    } else if (dt % 2 == dist % 2) {
      continue;
    } else {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  return 0;
}
