import java.util.Scanner;
//086C
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
		int n =sc.nextInt();
		int preT =0;
		int preX =0;
		int preY =0;
		boolean isReachable =true;
		
		for (int i=0;i<n;i++) {
			int postT =sc.nextInt();
			int postX =sc.nextInt();
			int postY =sc.nextInt();
			
			int manDis =postT-preT;
			int x =Math.abs(postX-preX);
			int y =Math.abs(postY-preY);
			
			if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			}
			preT =postT;
			preX =postX;
			preY =postY;
		}
		
		if (isReachable) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
		
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
	}
} import java.util.Scanner; Scanner java.util public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
		int n =sc.nextInt();
		int preT =0;
		int preX =0;
		int preY =0;
		boolean isReachable =true;
		
		for (int i=0;i<n;i++) {
			int postT =sc.nextInt();
			int postX =sc.nextInt();
			int postY =sc.nextInt();
			
			int manDis =postT-preT;
			int x =Math.abs(postX-preX);
			int y =Math.abs(postY-preY);
			
			if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			}
			preT =postT;
			preX =postX;
			preY =postY;
		}
		
		if (isReachable) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
		
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
		int n =sc.nextInt();
		int preT =0;
		int preX =0;
		int preY =0;
		boolean isReachable =true;
		
		for (int i=0;i<n;i++) {
			int postT =sc.nextInt();
			int postX =sc.nextInt();
			int postY =sc.nextInt();
			
			int manDis =postT-preT;
			int x =Math.abs(postX-preX);
			int y =Math.abs(postY-preY);
			
			if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			}
			preT =postT;
			preX =postX;
			preY =postY;
		}
		
		if (isReachable) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
		
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
	} main {
		Scanner sc = new Scanner(System.in);
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
		int n =sc.nextInt();
		int preT =0;
		int preX =0;
		int preY =0;
		boolean isReachable =true;
		
		for (int i=0;i<n;i++) {
			int postT =sc.nextInt();
			int postX =sc.nextInt();
			int postY =sc.nextInt();
			
			int manDis =postT-preT;
			int x =Math.abs(postX-preX);
			int y =Math.abs(postY-preY);
			
			if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			}
			preT =postT;
			preX =postX;
			preY =postY;
		}
		
		if (isReachable) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
		
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n =sc.nextInt(); n sc.nextInt() sc.nextInt sc int preT =0; preT 0 int preX =0; preX 0 int preY =0; preY 0 boolean isReachable =true; isReachable true for (int i=0;i<n;i++) {
			int postT =sc.nextInt();
			int postX =sc.nextInt();
			int postY =sc.nextInt();
			
			int manDis =postT-preT;
			int x =Math.abs(postX-preX);
			int y =Math.abs(postY-preY);
			
			if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			}
			preT =postT;
			preX =postX;
			preY =postY;
		} int i=0; int i=0; i 0 i<n i n i++ i++ i {
			int postT =sc.nextInt();
			int postX =sc.nextInt();
			int postY =sc.nextInt();
			
			int manDis =postT-preT;
			int x =Math.abs(postX-preX);
			int y =Math.abs(postY-preY);
			
			if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			}
			preT =postT;
			preX =postX;
			preY =postY;
		} {
			int postT =sc.nextInt();
			int postX =sc.nextInt();
			int postY =sc.nextInt();
			
			int manDis =postT-preT;
			int x =Math.abs(postX-preX);
			int y =Math.abs(postY-preY);
			
			if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			}
			preT =postT;
			preX =postX;
			preY =postY;
		} int postT =sc.nextInt(); postT sc.nextInt() sc.nextInt sc int postX =sc.nextInt(); postX sc.nextInt() sc.nextInt sc int postY =sc.nextInt(); postY sc.nextInt() sc.nextInt sc int manDis =postT-preT; manDis postT-preT postT preT int x =Math.abs(postX-preX); x Math.abs(postX-preX) Math.abs Math postX-preX postX preX int y =Math.abs(postY-preY); y Math.abs(postY-preY) Math.abs Math postY-preY postY preY if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			} x+y>manDis||(manDis-(x+y))%2!=0 x+y>manDis x+y x y manDis (manDis-(x+y))%2!=0 (manDis-(x+y))%2 (manDis-(x+y)) manDis (x+y) x y 2 0 {
				isReachable =false;
				break;
			} isReachable =false isReachable false break; preT =postT preT postT preX =postX preX postX preY =postY preY postY if (isReachable) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		} isReachable {
			System.out.println("Yes");
		} System.out.println("Yes") System.out.println System.out System System.out "Yes" {
			System.out.println("No");
		} System.out.println("No") System.out.println System.out System System.out "No" String[] args args public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
		int n =sc.nextInt();
		int preT =0;
		int preX =0;
		int preY =0;
		boolean isReachable =true;
		
		for (int i=0;i<n;i++) {
			int postT =sc.nextInt();
			int postX =sc.nextInt();
			int postY =sc.nextInt();
			
			int manDis =postT-preT;
			int x =Math.abs(postX-preX);
			int y =Math.abs(postY-preY);
			
			if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			}
			preT =postT;
			preX =postX;
			preY =postY;
		}
		
		if (isReachable) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
		
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
	}
} public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
		int n =sc.nextInt();
		int preT =0;
		int preX =0;
		int preY =0;
		boolean isReachable =true;
		
		for (int i=0;i<n;i++) {
			int postT =sc.nextInt();
			int postX =sc.nextInt();
			int postY =sc.nextInt();
			
			int manDis =postT-preT;
			int x =Math.abs(postX-preX);
			int y =Math.abs(postY-preY);
			
			if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			}
			preT =postT;
			preX =postX;
			preY =postY;
		}
		
		if (isReachable) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
		
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
	}
} Main
import java.util.Scanner;
//086C
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
		int n =sc.nextInt();
		int preT =0;
		int preX =0;
		int preY =0;
		boolean isReachable =true;
		
		for (int i=0;i<n;i++) {
			int postT =sc.nextInt();
			int postX =sc.nextInt();
			int postY =sc.nextInt();
			
			int manDis =postT-preT;
			int x =Math.abs(postX-preX);
			int y =Math.abs(postY-preY);
			
			if (x+y>manDis||(manDis-(x+y))%2!=0) {
				isReachable =false;
				break;
			}
			preT =postT;
			preX =postX;
			preY =postY;
		}
		
		if (isReachable) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
		
		//━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
	}
}