import java.util.*;
import static java.lang.Math.*;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		// 入力
		int n = sc.nextInt();// 中間ポイントの数

		int[] p = new int[n * 3];
		for(int i = 0; i < n * 3; i++){
			p[i] = sc.nextInt();
		}

		//
		String result = "Yes";
		for(int i = 0; i < n; i++){

			int t = 0;
			int x = 0;
			int y = 0;

			if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			}
			
			if(!canGo(t, x, y)){
				result = "No";
				break;
			}
		}

		// 出力
		System.out.println(result);
	}

	// 移動可能か
	static boolean canGo(int t, int x, int y){
		//System.out.print("t:" + t + " x:" + x + " y:" + y);

		// 制約条件
		if(t < abs(x) + abs(y)){
			// System.out.println(" No(条件１)");
			return false;
		}
		if(t%2 != abs(x + y)%2){
			// System.out.println(" No(条件２)");
			return false;
		}

		// System.out.println(" Yes");
		return true;
	}
}

 import java.util.*; util.* java import static java.lang.Math.*; import static java.lang.Math.*; import static java.lang.Math.*; public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		// 入力
		int n = sc.nextInt();// 中間ポイントの数

		int[] p = new int[n * 3];
		for(int i = 0; i < n * 3; i++){
			p[i] = sc.nextInt();
		}

		//
		String result = "Yes";
		for(int i = 0; i < n; i++){

			int t = 0;
			int x = 0;
			int y = 0;

			if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			}
			
			if(!canGo(t, x, y)){
				result = "No";
				break;
			}
		}

		// 出力
		System.out.println(result);
	}

	// 移動可能か
	static boolean canGo(int t, int x, int y){
		//System.out.print("t:" + t + " x:" + x + " y:" + y);

		// 制約条件
		if(t < abs(x) + abs(y)){
			// System.out.println(" No(条件１)");
			return false;
		}
		if(t%2 != abs(x + y)%2){
			// System.out.println(" No(条件２)");
			return false;
		}

		// System.out.println(" Yes");
		return true;
	}
} Main public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		// 入力
		int n = sc.nextInt();// 中間ポイントの数

		int[] p = new int[n * 3];
		for(int i = 0; i < n * 3; i++){
			p[i] = sc.nextInt();
		}

		//
		String result = "Yes";
		for(int i = 0; i < n; i++){

			int t = 0;
			int x = 0;
			int y = 0;

			if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			}
			
			if(!canGo(t, x, y)){
				result = "No";
				break;
			}
		}

		// 出力
		System.out.println(result);
	} main {
		Scanner sc = new Scanner(System.in);

		// 入力
		int n = sc.nextInt();// 中間ポイントの数

		int[] p = new int[n * 3];
		for(int i = 0; i < n * 3; i++){
			p[i] = sc.nextInt();
		}

		//
		String result = "Yes";
		for(int i = 0; i < n; i++){

			int t = 0;
			int x = 0;
			int y = 0;

			if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			}
			
			if(!canGo(t, x, y)){
				result = "No";
				break;
			}
		}

		// 出力
		System.out.println(result);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] p = new int[n * 3]; p new int[n * 3] n * 3 n 3 for(int i = 0; i < n * 3; i++){
			p[i] = sc.nextInt();
		} int i = 0; int i = 0; i 0 i < n * 3 i n * 3 n 3 i++ i++ i {
			p[i] = sc.nextInt();
		} {
			p[i] = sc.nextInt();
		} p[i] = sc.nextInt() p[i] p i sc.nextInt() sc.nextInt sc String result = "Yes"; result "Yes" for(int i = 0; i < n; i++){

			int t = 0;
			int x = 0;
			int y = 0;

			if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			}
			
			if(!canGo(t, x, y)){
				result = "No";
				break;
			}
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {

			int t = 0;
			int x = 0;
			int y = 0;

			if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			}
			
			if(!canGo(t, x, y)){
				result = "No";
				break;
			}
		} {

			int t = 0;
			int x = 0;
			int y = 0;

			if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			}
			
			if(!canGo(t, x, y)){
				result = "No";
				break;
			}
		} int t = 0; t 0 int x = 0; x 0 int y = 0; y 0 if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			} i == 0 i 0 {
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			} t = p[i * 3] t p[i * 3] p i * 3 i 3 x = p[i * 3 + 1] x p[i * 3 + 1] p i * 3 + 1 i * 3 i 3 1 y = p[i * 3 + 2] y p[i * 3 + 2] p i * 3 + 2 i * 3 i 3 2 {
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			} t = p[i * 3] - p[(i - 1) * 3] t p[i * 3] - p[(i - 1) * 3] p[i * 3] p i * 3 i 3 p[(i - 1) * 3] p (i - 1) * 3 (i - 1) i 1 3 x = p[i * 3 + 1] - p[(i - 1) * 3 + 1] x p[i * 3 + 1] - p[(i - 1) * 3 + 1] p[i * 3 + 1] p i * 3 + 1 i * 3 i 3 1 p[(i - 1) * 3 + 1] p (i - 1) * 3 + 1 (i - 1) * 3 (i - 1) i 1 3 1 y = p[i * 3 + 2] - p[(i - 1) * 3 + 2] y p[i * 3 + 2] - p[(i - 1) * 3 + 2] p[i * 3 + 2] p i * 3 + 2 i * 3 i 3 2 p[(i - 1) * 3 + 2] p (i - 1) * 3 + 2 (i - 1) * 3 (i - 1) i 1 3 2 if(!canGo(t, x, y)){
				result = "No";
				break;
			} !canGo(t, x, y) canGo(t, x, y) canGo t x y {
				result = "No";
				break;
			} result = "No" result "No" break; System.out.println(result) System.out.println System.out System System.out result String[] args args // 移動可能か
	static boolean canGo(int t, int x, int y){
		//System.out.print("t:" + t + " x:" + x + " y:" + y);

		// 制約条件
		if(t < abs(x) + abs(y)){
			// System.out.println(" No(条件１)");
			return false;
		}
		if(t%2 != abs(x + y)%2){
			// System.out.println(" No(条件２)");
			return false;
		}

		// System.out.println(" Yes");
		return true;
	} canGo {
		//System.out.print("t:" + t + " x:" + x + " y:" + y);

		// 制約条件
		if(t < abs(x) + abs(y)){
			// System.out.println(" No(条件１)");
			return false;
		}
		if(t%2 != abs(x + y)%2){
			// System.out.println(" No(条件２)");
			return false;
		}

		// System.out.println(" Yes");
		return true;
	} if(t < abs(x) + abs(y)){
			// System.out.println(" No(条件１)");
			return false;
		} t < abs(x) + abs(y) t abs(x) + abs(y) abs(x) abs x abs(y) abs y {
			// System.out.println(" No(条件１)");
			return false;
		} return false; false if(t%2 != abs(x + y)%2){
			// System.out.println(" No(条件２)");
			return false;
		} t%2 != abs(x + y)%2 t%2 t 2 abs(x + y)%2 abs(x + y) abs x + y x y 2 {
			// System.out.println(" No(条件２)");
			return false;
		} return false; false return true; true int t t int x x int y y public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		// 入力
		int n = sc.nextInt();// 中間ポイントの数

		int[] p = new int[n * 3];
		for(int i = 0; i < n * 3; i++){
			p[i] = sc.nextInt();
		}

		//
		String result = "Yes";
		for(int i = 0; i < n; i++){

			int t = 0;
			int x = 0;
			int y = 0;

			if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			}
			
			if(!canGo(t, x, y)){
				result = "No";
				break;
			}
		}

		// 出力
		System.out.println(result);
	}

	// 移動可能か
	static boolean canGo(int t, int x, int y){
		//System.out.print("t:" + t + " x:" + x + " y:" + y);

		// 制約条件
		if(t < abs(x) + abs(y)){
			// System.out.println(" No(条件１)");
			return false;
		}
		if(t%2 != abs(x + y)%2){
			// System.out.println(" No(条件２)");
			return false;
		}

		// System.out.println(" Yes");
		return true;
	}
} public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		// 入力
		int n = sc.nextInt();// 中間ポイントの数

		int[] p = new int[n * 3];
		for(int i = 0; i < n * 3; i++){
			p[i] = sc.nextInt();
		}

		//
		String result = "Yes";
		for(int i = 0; i < n; i++){

			int t = 0;
			int x = 0;
			int y = 0;

			if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			}
			
			if(!canGo(t, x, y)){
				result = "No";
				break;
			}
		}

		// 出力
		System.out.println(result);
	}

	// 移動可能か
	static boolean canGo(int t, int x, int y){
		//System.out.print("t:" + t + " x:" + x + " y:" + y);

		// 制約条件
		if(t < abs(x) + abs(y)){
			// System.out.println(" No(条件１)");
			return false;
		}
		if(t%2 != abs(x + y)%2){
			// System.out.println(" No(条件２)");
			return false;
		}

		// System.out.println(" Yes");
		return true;
	}
} Main
import java.util.*;
import static java.lang.Math.*;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		// 入力
		int n = sc.nextInt();// 中間ポイントの数

		int[] p = new int[n * 3];
		for(int i = 0; i < n * 3; i++){
			p[i] = sc.nextInt();
		}

		//
		String result = "Yes";
		for(int i = 0; i < n; i++){

			int t = 0;
			int x = 0;
			int y = 0;

			if(i == 0){
				t = p[i * 3];
				x = p[i * 3 + 1];
				y = p[i * 3 + 2];
			}else{
				t = p[i * 3] - p[(i - 1) * 3];
				x = p[i * 3 + 1] - p[(i - 1) * 3 + 1];
				y = p[i * 3 + 2] - p[(i - 1) * 3 + 2];
			}
			
			if(!canGo(t, x, y)){
				result = "No";
				break;
			}
		}

		// 出力
		System.out.println(result);
	}

	// 移動可能か
	static boolean canGo(int t, int x, int y){
		//System.out.print("t:" + t + " x:" + x + " y:" + y);

		// 制約条件
		if(t < abs(x) + abs(y)){
			// System.out.println(" No(条件１)");
			return false;
		}
		if(t%2 != abs(x + y)%2){
			// System.out.println(" No(条件２)");
			return false;
		}

		// System.out.println(" Yes");
		return true;
	}
}


