import java.util.Scanner;

public class Main{
    public static void main(String[] args) {
        final int T = 0;
        final int X = 1;
        final int Y = 2;
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int[][] travel = new int[n][3];
        for(int i=0;i<n;i++){
            for(int j=0;j<3;j++){
                travel[i][j] = Integer.parseInt(sc.next());
            }
        }
        boolean can = true;
        int pt=0, px=0, py=0;
        for(int i=0;i<n;i++){
            int d = length(px, py, travel[i][X], travel[i][Y]);
            int t = travel[i][T] - pt;
            if(d>t){
                can = false;
                break;
            }else if((t-d)%2==1){
                can = false;
                break;
            }
            px = travel[i][X]; py=travel[i][Y]; pt=travel[i][T];
        }
        if(can){
            System.out.println("Yes");
        }else{
            System.out.println("No");
        }
    }
    static int length(int px, int py, int cx, int cy){
        return(Math.abs(cx-px)+Math.abs(cy-py));
    }
}
/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