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];
		int[] x = new int[n];
		int[] y = new int[n];
		for(int i = 0 ; i < n ; i++) {
			t[i] = sc.nextInt();
			x[i] = sc.nextInt();
			y[i] = sc.nextInt();
		}
		int nowT = 0;
		int X = 0;
		int Y = 0;
		for(int i = 0 ; i < n ; i++) {
			if(t[i] - nowT == Math.abs(x[i] - X) + Math.abs(y[i] - Y)) {
				nowT = t[i];
				X = x[i];
				Y = y[i];
			} else if(t[i] - nowT > Math.abs(x[i] - X) + Math.abs(y[i] - Y) && nowT % 2 == (t[i] - nowT) % 2) {
				nowT = t[i];
				X = x[i];
				Y = y[i];
			} else {
				System.out.println("No");
				return;
			}
		}
		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