local times = io.read("*l")
local paths = {}
for i = 1,times do
	local tmp = {}
	for j = 1,3 do
		tmp[j] = io.read("*n")
	end
	paths[i] = tmp
end
local pos = {0,0,0}
for k,v in ipairs(paths) do
	local step = v[1] - pos[1]
	local x = v[2]
	local y = v[3]
	local dis = math.abs(x - pos[1]) + math.abs(y - pos[2])
	if dis < step  or (dis-step)%2 == 1 then
		print("No")
	end
	pos = v
end
print("Yes")