import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container;
import std.numeric, std.math;
import core.bitop;

T RD(T = string)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }

long mod = pow(10, 9) + 7;
long moda(long x, long y) { return (x + y) % mod; }
long mods(long x, long y) { return ((x + mod) - (y % mod)) % mod; }
long modm(long x, long y) { return (x * y) % mod; }

void main()
{
	auto N = RD!long;

	bool ans = true;
	long[2] pos;
	long lastTime;
	foreach (i; 0..N)
	{
		auto t = RD!long;
		auto x = RD!long;
		auto y = RD!long;
		auto d = abs(x - pos[0]) + abs(y - pos[1]);
		auto use_t = t - lastTime;
		if (d > use_t || (use_t - d) % 2 == 1)
		{
			ans = false;
			break;
		}
		pos = [x, y];
		lastTime = t;
	}

	writeln(ans ? "Yes" : "No");
	stdout.flush();
}