import java.util.*;
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();
      }
      for(int i = 0;i <= n-1;i++){
      	int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        }
      }
      System.out.println("Yes");
    }
    public static int lcm(int x, int y){
      return x*y/gcd(x,y);
    }
    public static int gcd(int x, int y){
      if(x < y)return gcd(y,x);
      if(y==0)return x;
      return gcd(y,x%y);
    }
} import java.util.*; util.* java 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();
      }
      for(int i = 0;i <= n-1;i++){
      	int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        }
      }
      System.out.println("Yes");
    }
    public static int lcm(int x, int y){
      return x*y/gcd(x,y);
    }
    public static int gcd(int x, int y){
      if(x < y)return gcd(y,x);
      if(y==0)return x;
      return gcd(y,x%y);
    }
} 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();
      }
      for(int i = 0;i <= n-1;i++){
      	int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        }
      }
      System.out.println("Yes");
    } main {
      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();
      }
      for(int i = 0;i <= n-1;i++){
      	int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        }
      }
      System.out.println("Yes");
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt 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 for(int i = 1;i <= n;i++){
      	t[i]=sc.nextInt();
        x[i]=sc.nextInt();
        y[i]=sc.nextInt();
      } int i = 1; int i = 1; i 1 i <= n i n i++ i++ i {
      	t[i]=sc.nextInt();
        x[i]=sc.nextInt();
        y[i]=sc.nextInt();
      } {
      	t[i]=sc.nextInt();
        x[i]=sc.nextInt();
        y[i]=sc.nextInt();
      } t[i]=sc.nextInt() t[i] t i sc.nextInt() sc.nextInt sc x[i]=sc.nextInt() x[i] x i sc.nextInt() sc.nextInt sc y[i]=sc.nextInt() y[i] y i sc.nextInt() sc.nextInt sc for(int i = 0;i <= n-1;i++){
      	int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        }
      } int i = 0; int i = 0; i 0 i <= n-1 i n-1 n 1 i++ i++ i {
      	int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        }
      } {
      	int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        }
      } int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]); k Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]) Math.abs(x[i+1]-x[i]) Math.abs Math x[i+1]-x[i] x[i+1] x i+1 i 1 x[i] x i Math.abs(y[i+1]-y[i]) Math.abs Math y[i+1]-y[i] y[i+1] y i+1 i 1 y[i] y i if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        } t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2 t[i+1]-t[i]<k t[i+1]-t[i] t[i+1] t i+1 i 1 t[i] t i k (t[i+1]-t[i])%2!=k%2 (t[i+1]-t[i])%2 (t[i+1]-t[i]) t[i+1] t i+1 i 1 t[i] t i 2 k%2 k 2 {
        	System.out.println("No");
            return;
        } System.out.println("No") System.out.println System.out System System.out "No" return; System.out.println("Yes") System.out.println System.out System System.out "Yes" String[] args args public static int lcm(int x, int y){
      return x*y/gcd(x,y);
    } lcm {
      return x*y/gcd(x,y);
    } return x*y/gcd(x,y); x*y/gcd(x,y) x*y x y gcd(x,y) gcd x y int x x int y y public static int gcd(int x, int y){
      if(x < y)return gcd(y,x);
      if(y==0)return x;
      return gcd(y,x%y);
    } gcd {
      if(x < y)return gcd(y,x);
      if(y==0)return x;
      return gcd(y,x%y);
    } if(x < y)return gcd(y,x); x < y x y return gcd(y,x); gcd(y,x) gcd y x if(y==0)return x; y==0 y 0 return x; x return gcd(y,x%y); gcd(y,x%y) gcd y x%y x y 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[] 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();
      }
      for(int i = 0;i <= n-1;i++){
      	int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        }
      }
      System.out.println("Yes");
    }
    public static int lcm(int x, int y){
      return x*y/gcd(x,y);
    }
    public static int gcd(int x, int y){
      if(x < y)return gcd(y,x);
      if(y==0)return x;
      return gcd(y,x%y);
    }
} 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();
      }
      for(int i = 0;i <= n-1;i++){
      	int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        }
      }
      System.out.println("Yes");
    }
    public static int lcm(int x, int y){
      return x*y/gcd(x,y);
    }
    public static int gcd(int x, int y){
      if(x < y)return gcd(y,x);
      if(y==0)return x;
      return gcd(y,x%y);
    }
} Main
import java.util.*;
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();
      }
      for(int i = 0;i <= n-1;i++){
      	int k = Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        if(t[i+1]-t[i]<k||(t[i+1]-t[i])%2!=k%2){
        	System.out.println("No");
            return;
        }
      }
      System.out.println("Yes");
    }
    public static int lcm(int x, int y){
      return x*y/gcd(x,y);
    }
    public static int gcd(int x, int y){
      if(x < y)return gcd(y,x);
      if(y==0)return x;
      return gcd(y,x%y);
    }
}