#include <bits/stdc++.h>
using namespace std;

#define lli long long int
#define ld long double
//初期化
#define DEFO(n) lli n = 0;
//整数最大
#define MAX(n) lli n = 9000000000000000000;
//整数最小
#define MIN(n) lli n = -9000000000000000000;
//少数最大
#define MAX_D(n) ld n = 4500;
//少数最小
#define MIN_D(n) ld n = -4500;
//整数入力
#define LLI(n) \
  lli n;       \
  cin >> n;
//少数入力
#define LD(n) \
  ld n;       \
  cin > n;
//整数配列入力
#define LLIV(a, n)            \
  vector<lli> a(n);           \
  for (lli i = 0; i < n; i++) \
  {                           \
    cin >> a.at(i);           \
  };
//２列整数配列入力
#define LLIV2(a, b, n)         \
  vector<lli> a(n), b(n);      \
  for (lli i = 0; i < n; i++)  \
  {                            \
    cin >> a.at(i) >> b.at(i); \
  };
//３列整数配列入力
#define LLIV3(a, b, c, n)                 \
  vector<lli> a(n), b(n), c(n);           \
  for (lli i = 0; i < n; i++)             \
  {                                       \
    cin >> a.at(i) >> b.at(i) >> c.at(i); \
  };
//少数配列入力
#define LDV(a, n)             \
  vector<ld> a(n);            \
  for (lli i = 0; i < n; i++) \
  {                           \
    cin >> a.at(i);           \
  };
//２列少数配列入力
#define LDV2(a, b, n)         \
  vector<ld> a(n), b(n);      \
  for (lli i = 0; i < n; i++)  \
  {                            \
    cin >> a.at(i) >> b.at(i); \
  };
//３列少数配列入力
#define LD3(a, b, c, n)                 \
  vector<ld> a(n), b(n), c(n);           \
  for (lli i = 0; i < n; i++)             \
  {                                       \
    cin >> a.at(i) >> b.at(i) >> c.at(i); \
  };
//文字列入力
#define STR(n) \
  string n;    \
  cin >> n;
//文字列配列入力
#define STRV(a, n)            \
  vector<string> a(n);        \
  for (lli i = 0; i < n; i++) \
  {                           \
    cin >> a.at(i);           \
  };
//配列の合計
#define SUM(n) accumulate(n.begin(), n.end(), 0);
//配列を昇順
#define SORT(n) sort(n.begin(), n.end());
//配列を降順
#define REVE(n) reverse(n.begin(), n.end());
//Yesと表示
#define yes              \
  cout << "Yes" << endl; \
  return 0;
//Noと表示
#define no              \
  cout << "No" << endl; \
  return 0;
//ACと表示
#define AC              \
  cout << "AC" << endl; \
  return 0;
//WAと表示
#define WA              \
  cout << "WA" << endl; \
  return 0;
//Noneと表示
#define none              \
  cout << "None" << endl; \
  return 0;
//Oddと表示
#define odd              \
  cout << "Odd" << endl; \
  return 0;
//Evenと表示
#define even              \
  cout << "Even" << endl; \
  return 0;
//四捨五入
#define C45(n) (n + 1) / 2
//nを出力
#define OUT(n) cout << n << endl;
//nを出力
#define DOUT(n, i) cout << fixed << setprecision(i) << n << endl;
//文字列からcを探す
#define SRC(n, c)                    \
  for (lli i = 0; i < s.size(); i++) \
  {                                  \
    if (s.at(i) == c)                \
    {                                \
      n++;                           \
    }                                \
  };
//素数
bool IsPrime(lli num)
{
  if (num < 2)
    return false;
  else if (num == 2)
    return true;
  else if (num % 2 == 0)
    return false;
  long double sqrtNum = sqrt(num);
  for (lli i = 3; i <= sqrtNum; i += 2)
  {
    if (num % i == 0)
      return false;
  }
  return true;
}
//各桁の和
lli KSum(lli n)
{
  lli sum = 0;
  if (n < 0)
    return 0;
  while (n > 0)
  {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
//数値反転
bool KReve(lli n)
{
  int reverse = 0;
  int remaind;
  int tmp = n;
  while (tmp != 0)
  {
    remaind = tmp % 10;
    reverse = reverse * 10 + remaind;
    tmp /= 10;
  }
  if (reverse == n)
    return true;
  else
    return false;
}
//最大公約数
lli gcd(lli a, lli b)
{
  if (a % b == 0)
  {
    return (b);
  }
  else
  {
    return (gcd(b, a % b));
  }
}
//最小公倍数
lli lcm(lli a, lli b)
{
  return a * b / gcd(a, b);
}
//階乗
lli factorial(lli n)
{
  lli a = 1;
  lli b = n;
  for (int i = 0; i < n; i++)
  {
    a *= b;
    b--;
  }
  return a;
}
//組み合わせ　nCr
lli comb(lli a, lli b)
{
  lli c;
  c = factorial(a) / (factorial(a - b) * factorial(b));
  return c;
}

int main(void)
{
  ios::sync_with_stdio(false);
  LLI(N)LLIV3(t, x, y, N)
  for(lli i = 0;i < N;i++) {
    if(i == 0) {
      if(t[0] == x[0] + y[0]) continue;
      else if(abs(x[0] + y[0]) % 2 == 0&&t[0] > abs(x[0] + y[0])) continue;
      else {no}
    }
    else {
      if(t[i]-t[i-1] == abs((x[i]-x[i-1]) + abs(y[i]-y[i-1]))) continue;
      else if(abs((x[i]-x[i-1]) + abs(y[i]-y[i-1])) % 2 == abs(t[i] - t[i-1]) % 2) {
        if (t[i] - t[i - 1] > abs((x[i]-x[i-1]) + abs(y[i]-y[i-1]))) continue;
        else
        {
          no
        }
      }
      else
      {
        no
      }
    }
  }
  yes
}


Measured memory_bytes: 2560