import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;

import std.math : abs;

void main() {
    int n;
    scan(n);

    int t, x, y;
    bool ok = 1;

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

        int dt = ti - t;
        int dist = abs(xi - x) + abs(yi - y);

        if (dt < dist || dt % 2 != dist % 2) {
            ok = 0;
        }

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

    writeln(ok ? "Yes" : "No");
}




void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    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);
        }
    }
}