// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
static immutable MOD=10^^9+7;alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std;
// dfmt on

void main()
{
    long N = lread();
    auto T = new long[](N);
    auto X = new long[](N);
    auto Y = new long[](N);
    foreach (i; 0 .. N)
        scan(T[i], X[i], Y[i]);
    long t;
    long x, y;
    foreach (i; 0 .. N)
    {
        long d = abs(x - X[i]) + abs(y - Y[i]);
        if ((T[i] - t) < d)
        {
            writeln("No");
            return;
        }
        if (((T[i] - t) - d) & 1)
        {
            writeln("No");
            return;
        }
        t = T[i];
        x = X[i];
        y = Y[i];
    }
    writeln("Yes");
}
