#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define ll long long
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;

const int MAXN=1e5+100;
const int INF=0x3FFFFFFF;
const ll MOD=1e9+7;

int t[MAXN],x[MAXN],y[MAXN];

int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>t[i]>>x[i]>>y[i];
    bool flag=1;
    for(int i=1;i<=n;i++)
    {
        if(x[i]-x[i-1]+y[i]-y[i-1]>t[i]-t[i-1]||(t[i]-t[i-1]-x[i]+x[i-1]-y[i]+y[i-1])%2!=0)
        {
            flag=0;
            break;
        }
    }
    if(flag)    cout<<"Yes"<<endl;
    else    cout<<"No"<<endl;
    return 0;
}
