#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 1010;
const int INF = 0x3f3f3f3f;
int main()
{
    int n;
    cin>>n;
    int nx=0,ny=0,nt=0,flag=0;
    while(n--){
        int t,x,y;
        cin>>t>>x>>y;
        int need = abs(nx-x)+abs(ny-y);
//        cout<<need<<endl;
        if(need <= (t-nt) && ((t-nt)-need)%2==0){
            nt=t;
            nx=x;
            ny=y;
        }
        else{
            flag = 1;
        }
    }
    if(!flag)
        cout<<"Yes"<<endl;
    else
        cout<<"No"<<endl;

    return 0;
}
