#include <bits/stdc++.h>
using namespace std;
int n;
int t[3];
int pos[3];
int main() {
  cin >> n;
  pos[1] = 0;
  pos[2] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 3; j++) {
      cin >> t[j];
    }
    int count = 0;
    if (pos[1] - t[1] < 0)
      count += (pos[1] - t[1]) * -1;
    else
      count += (pos[1] - t[1]);
    if (pos[2] - t[2] < 0)
      count += (pos[2] - t[2]) * -1;
    else
      count += (pos[2] - t[2]);
    if ((count >= t[0]) || ((t[0] - count) % 2 == 1)) {
      cout << "No" << endl;
      return 0;
    }
    for (int i = 0; i < 3; i++) {
      pos[i] = t[i];
    }
  }
  cout << "Yes" << endl;
  return 0;
}
