#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <set>
#define LL long long
using namespace std;
const int maxn = 1e5 + 10;
struct{
	int x,y,t;
}a[maxn];
int main()
{
	bool yes = true;
	int n,x,y,t,i,j;
	cin>>n;
	for(i=0;i<n;i++){ 
		scanf("%d%d%d",&a[i].t,&a[i].x,&a[i].y);	
	}
	if( a[0].t>=(a[0].x+a[0].y) && (a[0].t-a[0].x-a[0].y)%2==0 ) yes = true;
	else {
		printf("No\n");return 0;
	}
	int tt,xx,yy;
	for(i=1;i<n;i++)
	{
		if(!yes) {printf("No\n");return 0;}
		tt = a[i].t - a[i-1].t;
		xx = abs(a[i].x - a[i-1].x);
		yy = abs(a[i].y - a[i-1].y);
		if(tt>=xx+yy&&(tt-xx-yy)%2==0) yes = true;
		else{printf("No\n");return 0;}	
	}
	 printf("Yes\n");
	
	
	return 0;
}