import std.stdio, std.string, std.conv;
import std.range, std.algorithm;
import std.math :abs;

void main() {
    int n;

    scan(n);

    int x, y, t;

    foreach (i ; 0 .. n) {
        int ti, xi, yi;
        scan(ti, xi, yi);

        int d = abs(xi - x) + abs(yi - y);
        int e = ((x + y) % 2) ^ ((xi + yi) % 2);

        if ((ti - t) < d || (ti - t) % 2 != e) {
            writeln("No");
            return;
        }

        x = xi, y = yi, t = ti;
    }

    writeln("Yes");
    return;
}



void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}