import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv,
    std.functional, std.math, std.numeric, std.range, std.stdio, std.string,
    std.random, std.typecons, std.container;

ulong MAX = 100_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () => readln.chomp.to!(T);
alias aryread(T = long) = () => readln.split.to!(T[]);
alias Pair = Tuple!(long, "a", long, "b");
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);

void main()
{
    auto n = lread();
    bool check = true;
    long pre_t, pre_x, pre_y;
    foreach (_; iota(n))
    {
        long t, x, y;
        scan(t, x, y);
        long dist = abs(x - pre_x) + abs(y - pre_y);
        if (t - pre_t < dist)
            check = false;
        if ((dist - (t - pre_t)) % 2)
            check = false;

        pre_t = t;
        pre_x = x;
        pre_y = y;
    }
    if (check)
        writeln("Yes");
    else
        writeln("No");
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
