#include <bits/stdc++.h>
using namespace std;
int N, dist, limit;
int t[100010];
int x[100010];
int y[100010];
int main() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(false);
  cin >> N;
  for (int i = 1; i <= N; ++i) cin >> t[i] >> x[i] >> y[i];
  for (int i = 1; i <= N; ++i) {
    dist = abs(x[i] - x[i - 1]) + abs(y[i] - y[i - 1]);
    limit = t[i] - t[i - 1];
    if (dist > t[i] || limit % 2 != dist % 2) {
      cout << "No";
      return 0;
    }
  }
  cout << "Yes";
  return 0;
}
