#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9, MOD = 1e9 + 7;
const long long LINF = 1e18;
long long int n = 1, cnt = 0, ans = 0, a, b, c, cmp, data, m, h, x[100000],
              y[100000], xcmp = 0, ycmp = 0, sum = 0, t[100000];
string s, w;
vector<int> z;
int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  for (long long int(i) = 0; (i) < (int)(n); (i)++) {
    cin >> t[i] >> x[i] >> y[i];
  }
  for (long long int(i) = 0; (i) < (int)(n); (i)++) {
    xcmp = max(x[i], x[i + 1]) - min(x[i], x[i + 1]);
    ycmp = max(y[i], y[i + 1]) - min(y[i], y[i + 1]);
    cmp = xcmp + ycmp;
    if ((t[i + 1] - t[i] - cmp) % 2 != 0 || t[i] <= cmp) {
      cout << ("No") << endl;
      return 0;
    }
  }
  cout << ("Yes") << endl;
  return 0;
}
