
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] t = new int[n+1];
		int[] x = new int[n+1];
		int[] y = new int[n+1];
		t[0] = 0;
		x[0] = 0;
		y[0] = 0;
		for(int i = 1; i < n+1; i++) {
			t[i] = Integer.parseInt(sc.next());
			x[i] = Integer.parseInt(sc.next());
			y[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		boolean ans = false;
		// どのときYes
		// dt >= dist && (dt - dist)%2==0
		for(int i = 0; i < n; i++) {
			int dt = t[i+1] - t[i];
			int dist = calcMan(x[i], y[i], x[i+1], y[i+1]);
			if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			}
		}
		if (ans) System.out.println("Yes");
		if (!ans) System.out.println("No");
		
		
	}
	public static int calcMan(int x, int y, int nx, int ny) {
		return Math.abs(nx - x) + Math.abs(ny - y);
		
	}

} import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] t = new int[n+1];
		int[] x = new int[n+1];
		int[] y = new int[n+1];
		t[0] = 0;
		x[0] = 0;
		y[0] = 0;
		for(int i = 1; i < n+1; i++) {
			t[i] = Integer.parseInt(sc.next());
			x[i] = Integer.parseInt(sc.next());
			y[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		boolean ans = false;
		// どのときYes
		// dt >= dist && (dt - dist)%2==0
		for(int i = 0; i < n; i++) {
			int dt = t[i+1] - t[i];
			int dist = calcMan(x[i], y[i], x[i+1], y[i+1]);
			if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			}
		}
		if (ans) System.out.println("Yes");
		if (!ans) System.out.println("No");
		
		
	}
	public static int calcMan(int x, int y, int nx, int ny) {
		return Math.abs(nx - x) + Math.abs(ny - y);
		
	}

} Main public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] t = new int[n+1];
		int[] x = new int[n+1];
		int[] y = new int[n+1];
		t[0] = 0;
		x[0] = 0;
		y[0] = 0;
		for(int i = 1; i < n+1; i++) {
			t[i] = Integer.parseInt(sc.next());
			x[i] = Integer.parseInt(sc.next());
			y[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		boolean ans = false;
		// どのときYes
		// dt >= dist && (dt - dist)%2==0
		for(int i = 0; i < n; i++) {
			int dt = t[i+1] - t[i];
			int dist = calcMan(x[i], y[i], x[i+1], y[i+1]);
			if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			}
		}
		if (ans) System.out.println("Yes");
		if (!ans) System.out.println("No");
		
		
	} main {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] t = new int[n+1];
		int[] x = new int[n+1];
		int[] y = new int[n+1];
		t[0] = 0;
		x[0] = 0;
		y[0] = 0;
		for(int i = 1; i < n+1; i++) {
			t[i] = Integer.parseInt(sc.next());
			x[i] = Integer.parseInt(sc.next());
			y[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		boolean ans = false;
		// どのときYes
		// dt >= dist && (dt - dist)%2==0
		for(int i = 0; i < n; i++) {
			int dt = t[i+1] - t[i];
			int dist = calcMan(x[i], y[i], x[i+1], y[i+1]);
			if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			}
		}
		if (ans) System.out.println("Yes");
		if (!ans) System.out.println("No");
		
		
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = Integer.parseInt(sc.next()); n Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int[] t = new int[n+1]; t new int[n+1] n+1 n 1 int[] x = new int[n+1]; x new int[n+1] n+1 n 1 int[] y = new int[n+1]; y new int[n+1] n+1 n 1 t[0] = 0 t[0] t 0 0 x[0] = 0 x[0] x 0 0 y[0] = 0 y[0] y 0 0 for(int i = 1; i < n+1; i++) {
			t[i] = Integer.parseInt(sc.next());
			x[i] = Integer.parseInt(sc.next());
			y[i] = Integer.parseInt(sc.next());
		} int i = 1; int i = 1; i 1 i < n+1 i n+1 n 1 i++ i++ i {
			t[i] = Integer.parseInt(sc.next());
			x[i] = Integer.parseInt(sc.next());
			y[i] = Integer.parseInt(sc.next());
		} {
			t[i] = Integer.parseInt(sc.next());
			x[i] = Integer.parseInt(sc.next());
			y[i] = Integer.parseInt(sc.next());
		} t[i] = Integer.parseInt(sc.next()) t[i] t i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc x[i] = Integer.parseInt(sc.next()) x[i] x i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc y[i] = Integer.parseInt(sc.next()) y[i] y i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc sc.close() sc.close sc boolean ans = false; ans false for(int i = 0; i < n; i++) {
			int dt = t[i+1] - t[i];
			int dist = calcMan(x[i], y[i], x[i+1], y[i+1]);
			if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			}
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			int dt = t[i+1] - t[i];
			int dist = calcMan(x[i], y[i], x[i+1], y[i+1]);
			if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			}
		} {
			int dt = t[i+1] - t[i];
			int dist = calcMan(x[i], y[i], x[i+1], y[i+1]);
			if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			}
		} int dt = t[i+1] - t[i]; dt t[i+1] - t[i] t[i+1] t i+1 i 1 t[i] t i int dist = calcMan(x[i], y[i], x[i+1], y[i+1]); dist calcMan(x[i], y[i], x[i+1], y[i+1]) calcMan x[i] x i y[i] y i x[i+1] x i+1 i 1 y[i+1] y i+1 i 1 if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			} dt >= dist && (dt - dist) % 2 ==0 dt >= dist dt dist (dt - dist) % 2 ==0 (dt - dist) % 2 (dt - dist) dt dist 2 0 {
				ans = true;
			} ans = true ans true {
				ans = false;
				break;
			} ans = false ans false break; if (ans) System.out.println("Yes"); ans System.out.println("Yes") System.out.println System.out System System.out "Yes" if (!ans) System.out.println("No"); !ans ans System.out.println("No") System.out.println System.out System System.out "No" String[] args args public static int calcMan(int x, int y, int nx, int ny) {
		return Math.abs(nx - x) + Math.abs(ny - y);
		
	} calcMan {
		return Math.abs(nx - x) + Math.abs(ny - y);
		
	} return Math.abs(nx - x) + Math.abs(ny - y); Math.abs(nx - x) + Math.abs(ny - y) Math.abs(nx - x) Math.abs Math nx - x nx x Math.abs(ny - y) Math.abs Math ny - y ny y int x x int y y int nx nx int ny ny public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] t = new int[n+1];
		int[] x = new int[n+1];
		int[] y = new int[n+1];
		t[0] = 0;
		x[0] = 0;
		y[0] = 0;
		for(int i = 1; i < n+1; i++) {
			t[i] = Integer.parseInt(sc.next());
			x[i] = Integer.parseInt(sc.next());
			y[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		boolean ans = false;
		// どのときYes
		// dt >= dist && (dt - dist)%2==0
		for(int i = 0; i < n; i++) {
			int dt = t[i+1] - t[i];
			int dist = calcMan(x[i], y[i], x[i+1], y[i+1]);
			if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			}
		}
		if (ans) System.out.println("Yes");
		if (!ans) System.out.println("No");
		
		
	}
	public static int calcMan(int x, int y, int nx, int ny) {
		return Math.abs(nx - x) + Math.abs(ny - y);
		
	}

} public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] t = new int[n+1];
		int[] x = new int[n+1];
		int[] y = new int[n+1];
		t[0] = 0;
		x[0] = 0;
		y[0] = 0;
		for(int i = 1; i < n+1; i++) {
			t[i] = Integer.parseInt(sc.next());
			x[i] = Integer.parseInt(sc.next());
			y[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		boolean ans = false;
		// どのときYes
		// dt >= dist && (dt - dist)%2==0
		for(int i = 0; i < n; i++) {
			int dt = t[i+1] - t[i];
			int dist = calcMan(x[i], y[i], x[i+1], y[i+1]);
			if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			}
		}
		if (ans) System.out.println("Yes");
		if (!ans) System.out.println("No");
		
		
	}
	public static int calcMan(int x, int y, int nx, int ny) {
		return Math.abs(nx - x) + Math.abs(ny - y);
		
	}

} Main

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] t = new int[n+1];
		int[] x = new int[n+1];
		int[] y = new int[n+1];
		t[0] = 0;
		x[0] = 0;
		y[0] = 0;
		for(int i = 1; i < n+1; i++) {
			t[i] = Integer.parseInt(sc.next());
			x[i] = Integer.parseInt(sc.next());
			y[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		boolean ans = false;
		// どのときYes
		// dt >= dist && (dt - dist)%2==0
		for(int i = 0; i < n; i++) {
			int dt = t[i+1] - t[i];
			int dist = calcMan(x[i], y[i], x[i+1], y[i+1]);
			if (dt >= dist && (dt - dist) % 2 ==0) {
				ans = true;
			} else {
				ans = false;
				break;
			}
		}
		if (ans) System.out.println("Yes");
		if (!ans) System.out.println("No");
		
		
	}
	public static int calcMan(int x, int y, int nx, int ny) {
		return Math.abs(nx - x) + Math.abs(ny - y);
		
	}

}
