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];
   int[] x = new int[N];
   int[] y = new int[N];
   for(int i=0;i<N;i++)
   {
     t[i] = sc.nextInt();
     x[i] = sc.nextInt();
     y[i] = sc.nextInt();
   }

   int tmpd =0;
   int tmpt =0;
   int tmpx =0;
   int tmpy =0;
   boolean cant = false;
   for(int i=0;i<N;i++) 
   {
     tmpd = Math.abs(tmpx-x[i])+Math.abs(tmpy-y[i]);
     if(tmpd>t[i]-tmpt)
     {
       cant = true;
       break;
     }
     else if((t[i]-tmpt-tmpd)%2==1)
     {
       cant = true;
       break;
     }
     tmpt=t[i];
     tmpx=x[i];
     tmpy=y[i];
   }
   String ans = "Yes";
   if(cant) ans = "No";
   System.out.println(ans);
 }
}
/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