import java.util.Scanner;

public class Main {
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        int N = scanner.nextInt();
        int[] t = new int[110000];
        int[] x = new int[110000];
        int[] y = new int[110000];
        t[0] = 0;
        x[0] = 0;
        y[0] = 0;
        for (int i = 0; i < N; i++) {
            t[i+1] = scanner.nextInt();
            x[i+1] = scanner.nextInt();
            y[i+1] = scanner.nextInt();
        }

        boolean result = true;

        for (int i = 0; i < N; i++) {
            int dt = t[i + 1] - t[i];
            int dist = Math.abs(x[i + 1] - x[i]) + Math.abs(y[i + 1] - y[i]);
            if (dt < dist) {
                result = false;
                break;
            }
            if (dt % 2 != dist %2) {
                result = false;
                break;
            }
        }

        if (result) {
            System.out.println("Yes");
        }else {
            System.out.println("No");
        }
    }
}
/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