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();		
		}
		
		int count = 0;
		
		for(int i = 1; i <= N; i++) {
			int check = Math.abs(x[i] - x[i - 1]) + Math.abs(y[i] - y[i - 1]) - (t[i] - t[i - 1]);
			if(check <= 0 && -check % 2 == 0) {
				count++;
			} else {
				System.out.println("No");
				break;
			}
		}
		if(count == N) {
			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