import java.util.Scanner;

public class Main {


	public static boolean hantei(int N, int t, int T, int x, int X, int y, int Y) {
		boolean plan = false;
		int rt = t - T;
		int dist = x + y - X - Y;
		if(rt >= dist && ((rt-dist)%2 == 0)) {
			plan = true;
		}
		return plan;
	}


	public static void main(String[] args) {
		int N,t,x,y;
		int T = 0;
		int X = 0;
		int Y = 0;
		boolean plan;
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();

		for(int i = 0; i < N; i++) {
			t = sc.nextInt();
			x = sc.nextInt();
			y = sc.nextInt();
			plan = hantei(N, t, T, x, X, y, Y);
			if(!plan){
				System.out.println("No");
				System.exit(0);
			}
			T = t;
			X = x;
			Y = y;
		}
		System.out.println("Yes");
		sc.close();
	}
}

/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