#include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <list>
#include <fstream>
#include <iomanip>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <nmmintrin.h>
#include <chrono>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 10000000
#define bitcheck(a,b)   ((a >> b) & 1)
#define bitset(a,b)      ( a |= (1 << b))
#define bitunset(a,b)    (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
	std::fill((T*)array, (T*)(array + N), val);
}

struct Edge {
	int from, to, weight;

	bool operator < (const Edge& obj) const {
		return weight < obj.weight;
	}
	bool operator > (const Edge& obj) const {
		return weight > obj.weight;
	}
};

struct UnionFind {
	vector<int> data;
	UnionFind(int size) : data(size, -1) { }
	bool unionSet(int x, int y) { //ｘの入って る集合と yの入ってる集合を併合
		x = root(x); y = root(y);
		if (x != y) {
			if (data[y] < data[x]) swap(x, y);
			data[x] += data[y]; data[y] = x;
		}
		return x != y;
	}
	bool findSet(int x, int y) { //xとyが同じ集合に入っているかどうかを判定
		return root(x) == root(y);
	}
	int root(int x) {
		return data[x] < 0 ? x : data[x] = root(data[x]);
	}
	bool isroot(int x) {
		return data[x] < 0;
	}
	int size(int x) {
		return -data[root(x)];
	}
};

int arr[100001];
void Eratosthenes(int N) {//Nまでの素数表
	for (int i = 0; i < N; i++) {
		arr[i] = 1;
	}
	for (int i = 2; i < sqrt(N); i++) {
		if (arr[i]) {
			for (int j = i * 2; j <= N; j += i) {
				arr[j] = 0;
			}
		}
	}
}
typedef pair<ll, ll> pll;
mt19937 ran;

int Has[4] = { (int)(ran() / 100),(int)(ran() / 100),(int)(ran() / 100),(int)(ran() / 100) };

struct RollingHash {
	const pll bai = { 181243 ,2251 };
	vector<pll> hash;
	vector<pll> base;
	int len;
	RollingHash(string str) : hash(str.length() + 1), base(str.length() + 1) {
		len = str.length();
		base[0].first = 1;
		base[0].second = 1;

		REP(i, len) {
			int num = str[i] == 'A' ? 0 : str[i] == 'T' ? 1 : str[i] == 'G' ? 2 : 3;
			(hash[i + 1].first = hash[i].first * bai.first + Has[num]) %= MODU;
			(hash[i + 1].second = hash[i].second * bai.second + Has[num]) %= 129402307;
			(base[i + 1].first = base[i].first * bai.first) %= MODU;
			(base[i + 1].second = base[i].second * bai.second) %= 129402307;
		}
	}

	pll Gethash(int l, int r) {
		return { (hash[r].first - (hash[l].first * base[r - l].first) % MODU + MODU) % MODU, (hash[r].second - (hash[l].second * base[r - l].second) % 129402307 + 129402307) % 129402307 };
	}

};

struct BIT {
	vector<ll> x;

#define SZ(a) (a&-a)
#define UP(a) (a+SZ(a))
#define LEFT(a) (a-SZ(a))

	BIT(int n) : x(n + 1) {}

	int sum(int r) {
		r++;
		ll ret = 0;
		for (int i = r; 0 < i; i = LEFT(i)) {
			ret += x[i];
		}
		return ret;
	}
	void add(int r, int v) {
		r++;
		for (int i = r; x.size() > i; i = UP(i)) {
			x[i] += v;
		}
	}
};

#ifdef _MSC_VER
#define __builtin_popcount _mm_popcnt_u32
#define __builtin_popcountll _mm_popcnt_u64
#endif
class Bitvector {
	//4byteブロック 全部半径、0-index
	static const int mask[32];
public:

	unsigned int* st;
	unsigned int* blockrank;
	int sz;
	Bitvector(int n) {
		sz = n;
		st = (unsigned int*)calloc((n + 31) / 32, sizeof(int));
		blockrank = (unsigned int*)calloc((n + 31) / 32 + 1, sizeof(int));
		if (st == NULL || blockrank == NULL)
			abort();
	}
	inline void set(int a, bool f) {//後から追加はできない
		if (f)bitset(st[a / 32], (31 - a % 32));
	}
	inline bool get(int a) { return bitcheck(st[a / 32], (31 - a % 32)); }
	inline void calcblock() {
		int cou = 0;
		REP(i, sz + 1) {
			if (i && !(i % 32))blockrank[i / 32] = cou;
			if (i < sz)cou += bitcheck(st[i / 32], (31 - i % 32));
		}
	}
	int rank(int a, bool t) {
		int ret = blockrank[a / 32] + (((32 - a % 32) >= 32) ? 0 : _mm_popcnt_u32(st[a / 32] >> (32 - a % 32)));
		return t ? ret : a - ret;
	}
	int select(int a, bool t) {
		int l = 0, r = sz + 1;

		while (r - l > 1) {
			int mid = (l + r) / 2;
			if (rank(mid, t) >= a) r = mid;
			else l = mid;
		}
		if (rank(r, t) < a) return -1;
		return r;
	}
	void clear() {
		free(st);
		free(blockrank);
	}
};

//プリミティブ型だけだよ！！！！(低レベルでうぇぶるので)
template<typename T>
class WaveletMatrix {
public:
	vector<T> data;
	vector<Bitvector> bitv;
	vector<int> border;
	int bitsize;
	WaveletMatrix(vector<T>& dat) : bitsize(sizeof(T) * 8), data(dat) {
		bitv.reserve(bitsize);
		REP(i, bitsize + 1)
			bitv.push_back(Bitvector(data.size()));
		border.resize(bitsize + 1);
		REP(j, data.size())
			bitv[0].set(j, bitcheck(data[j], bitsize - 1));
		bitv[0].calcblock();
		vector<T> buf[2];
		buf[0] = data;
		buf[1].resize(data.size());

		REP(i, bitsize - 1) {
			border[i + 1] = bitv[i].rank(data.size(), 0);
			int cou[2] = { 0, border[i + 1] };
			REP(j, data.size()) {
				bitv[i + 1].set(cou[bitv[i].get(j)], bitcheck(buf[i % 2][j], bitsize - i - 2));
				buf[1 - i % 2][cou[bitv[i].get(j)]] = buf[i % 2][j] << (i + 1) >> (i + 1);
				cou[bitv[i].get(j)]++;
			}
			bitv[i + 1].calcblock();
		}
		border[bitsize] = bitv[bitsize - 1].rank(data.size(), 0);
	}

	pii search(int s, int e, unsigned int t, int b = 0) {
		if (b == bitsize) return{ s,e };
		bool cur = bitcheck(t, bitsize - 1);
		return search(cur*border[b + 1] + bitv[b].rank(s, cur), cur*border[b + 1] + bitv[b].rank(e, cur), t << 1, b + 1);
	}
	int backward(int a, unsigned int t, int b = 0) {
		if (b == bitsize - 1) return a;
		backward(bitv[bitsize - b - 1].select(a + 1 - bitcheck(t, 0) * border[bitsize - b], bitcheck(t, 0)) - 1, t >> 1, b + 1);
	}

	int rank(int s, int e, T t) {
		pii r = search(s, e, t);
		return r.second - r.first;
	}

	int select(int a, T t) {
		pii r = search(0, data.size(), t);
		return  backward(r.first + a - 1, t);
	}

	T kthelement(int s, int e, int k, int b = 0) {
		int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = eo - so;
		if (b == bitsize - 1) return cou <= k;
		return (cou <= k ?
			kthelement(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), k - cou, b + 1) :
			kthelement(so, so + cou, k, b + 1)) | ((cou <= k) << (bitsize - b - 1));
	}
	int less(int s, int e, T t, int b = 0) {
		int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = (eo - so);
		if (b == bitsize) return e - s;
		return bitcheck(t, bitsize - b - 1) ?
			less(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), t, b + 1) + cou :
			less(so, so + cou, t, b + 1);
	}

	~WaveletMatrix() {
		REP(i, bitsize) bitv[i].clear();
	}
};
int main()
{
	int n,ct = 0;
	cin >> n;
	pii cp = {};
	REP(i, n) {
		int t, x, y;
		scnaf("%d %d %d", &t, &x, &y);

		int dis = abs(cp.first - x) + abs(cp.second - y);

		if (dis > (t - ct)) {
			cout << "No" << endl;
			return 0;
		}

		if ((t - ct - dis) % 2) {
			cout << "No" << endl;
			return 0;
		}

		ct = t;
		cp = { x,y };

	}

	cout << "Yes" << endl;


	return 0;
}


Measured memory_bytes: 256