import java.util.Scanner;

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

        boolean isPossible = true;
        for(int i = 1;i <= n;i++) {
            int dt = t[i] - t[i - 1];
            int dx = Math.abs(x[i] - x[i - 1]);
            int dy = Math.abs(y[i] - y[i - 1]);

            if(dx + dy > dt) {
                isPossible = false;
                break;
            }
            else if(dt % 2 == 0) {
                if((dx + dy) % 2 != 0) {
                    isPossible = false;
                    break;
                }
            }
            else if(dt % 2 != 0) {
                if((dx + dy) % 2 == 0) {
                    isPossible = false;
                    break;
                }
            }
        }

        String ans = isPossible ? "Yes" : "No";
        System.out.println(ans);
    }
}
/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