import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int t[] = new int[n];
        int x[] = new int[n];
        int y[] = new int[n];
        for (int i = 0; i < n; i++) {
            t[i] = in.nextInt();
            x[i] = in.nextInt();
            y[i] = in.nextInt();
        }

        int ct = 0, cx = 0, cy = 0;
        for (int i = 0; i < n; i++) {
            int time = t[i] - ct;
            int diffX = Math.abs(x[i] - cx);
            int diffY = Math.abs(y[i] - cy);

            if (diffX + diffY > time) {
                System.out.println("No");
                return;
            }

            if (time % 2 != (diffX + diffY) % 2) {
                System.out.println("No");
                return;
            }

            ct = t[i];
            cx = x[i];
            cy = y[i];
        }

        System.out.println("Yes");
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz