import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        
        // Your code here!
        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];        
        
        T[0] = 0;
        X[0] = 0;
        Y[0] = 0;
        
        for(int i = 1 ; i < N + 1 ; i++){
            T[i] = sc.nextInt();
            X[i] = sc.nextInt();
            Y[i] = sc.nextInt();
        }
        
        for(int i = N  ; i > 0 ; i--){
            int needT = T[i] - T[i - 1];
            int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]);
            //時間が余っていなければアウト
            if(needT < needP){
                break;
            }
            //つぶせる時間は偶数である
            if((needT - needP) % 2 == 1){
                break;
            }
            System.out.println("Yes");
            return;
            
        }
        System.out.println("No");
        
    }
} import java.io.BufferedReader; BufferedReader java.io import java.io.InputStreamReader; InputStreamReader java.io import java.util.*; util.* java public class Main {
    public static void main(String[] args) throws Exception {
        
        // Your code here!
        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];        
        
        T[0] = 0;
        X[0] = 0;
        Y[0] = 0;
        
        for(int i = 1 ; i < N + 1 ; i++){
            T[i] = sc.nextInt();
            X[i] = sc.nextInt();
            Y[i] = sc.nextInt();
        }
        
        for(int i = N  ; i > 0 ; i--){
            int needT = T[i] - T[i - 1];
            int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]);
            //時間が余っていなければアウト
            if(needT < needP){
                break;
            }
            //つぶせる時間は偶数である
            if((needT - needP) % 2 == 1){
                break;
            }
            System.out.println("Yes");
            return;
            
        }
        System.out.println("No");
        
    }
} Main public static void main(String[] args) throws Exception {
        
        // Your code here!
        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];        
        
        T[0] = 0;
        X[0] = 0;
        Y[0] = 0;
        
        for(int i = 1 ; i < N + 1 ; i++){
            T[i] = sc.nextInt();
            X[i] = sc.nextInt();
            Y[i] = sc.nextInt();
        }
        
        for(int i = N  ; i > 0 ; i--){
            int needT = T[i] - T[i - 1];
            int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]);
            //時間が余っていなければアウト
            if(needT < needP){
                break;
            }
            //つぶせる時間は偶数である
            if((needT - needP) % 2 == 1){
                break;
            }
            System.out.println("Yes");
            return;
            
        }
        System.out.println("No");
        
    } main {
        
        // Your code here!
        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];        
        
        T[0] = 0;
        X[0] = 0;
        Y[0] = 0;
        
        for(int i = 1 ; i < N + 1 ; i++){
            T[i] = sc.nextInt();
            X[i] = sc.nextInt();
            Y[i] = sc.nextInt();
        }
        
        for(int i = N  ; i > 0 ; i--){
            int needT = T[i] - T[i - 1];
            int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]);
            //時間が余っていなければアウト
            if(needT < needP){
                break;
            }
            //つぶせる時間は偶数である
            if((needT - needP) % 2 == 1){
                break;
            }
            System.out.println("Yes");
            return;
            
        }
        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[] 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] = sc.nextInt();
            X[i] = sc.nextInt();
            Y[i] = sc.nextInt();
        } int i = 1 ; int i = 1 ; i 1 i < N + 1 i N + 1 N 1 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 = N  ; i > 0 ; i--){
            int needT = T[i] - T[i - 1];
            int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]);
            //時間が余っていなければアウト
            if(needT < needP){
                break;
            }
            //つぶせる時間は偶数である
            if((needT - needP) % 2 == 1){
                break;
            }
            System.out.println("Yes");
            return;
            
        } int i = N  ; int i = N  ; i N i > 0 i 0 i-- i-- i {
            int needT = T[i] - T[i - 1];
            int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]);
            //時間が余っていなければアウト
            if(needT < needP){
                break;
            }
            //つぶせる時間は偶数である
            if((needT - needP) % 2 == 1){
                break;
            }
            System.out.println("Yes");
            return;
            
        } {
            int needT = T[i] - T[i - 1];
            int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]);
            //時間が余っていなければアウト
            if(needT < needP){
                break;
            }
            //つぶせる時間は偶数である
            if((needT - needP) % 2 == 1){
                break;
            }
            System.out.println("Yes");
            return;
            
        } int needT = T[i] - T[i - 1]; needT T[i] - T[i - 1] T[i] T i T[i - 1] T i - 1 i 1 int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]); needP Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]) Math.abs(X[i] - X[i - 1]) Math.abs Math X[i] - X[i - 1] X[i] X i X[i - 1] X i - 1 i 1 Math.abs(Y[i] - Y[i - 1]) Math.abs Math Y[i] - Y[i - 1] Y[i] Y i Y[i - 1] Y i - 1 i 1 if(needT < needP){
                break;
            } needT < needP needT needP {
                break;
            } break; if((needT - needP) % 2 == 1){
                break;
            } (needT - needP) % 2 == 1 (needT - needP) % 2 (needT - needP) needT needP 2 1 {
                break;
            } break; System.out.println("Yes") System.out.println System.out System System.out "Yes" return; 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) throws Exception {
        
        // Your code here!
        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];        
        
        T[0] = 0;
        X[0] = 0;
        Y[0] = 0;
        
        for(int i = 1 ; i < N + 1 ; i++){
            T[i] = sc.nextInt();
            X[i] = sc.nextInt();
            Y[i] = sc.nextInt();
        }
        
        for(int i = N  ; i > 0 ; i--){
            int needT = T[i] - T[i - 1];
            int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]);
            //時間が余っていなければアウト
            if(needT < needP){
                break;
            }
            //つぶせる時間は偶数である
            if((needT - needP) % 2 == 1){
                break;
            }
            System.out.println("Yes");
            return;
            
        }
        System.out.println("No");
        
    }
} public class Main {
    public static void main(String[] args) throws Exception {
        
        // Your code here!
        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];        
        
        T[0] = 0;
        X[0] = 0;
        Y[0] = 0;
        
        for(int i = 1 ; i < N + 1 ; i++){
            T[i] = sc.nextInt();
            X[i] = sc.nextInt();
            Y[i] = sc.nextInt();
        }
        
        for(int i = N  ; i > 0 ; i--){
            int needT = T[i] - T[i - 1];
            int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]);
            //時間が余っていなければアウト
            if(needT < needP){
                break;
            }
            //つぶせる時間は偶数である
            if((needT - needP) % 2 == 1){
                break;
            }
            System.out.println("Yes");
            return;
            
        }
        System.out.println("No");
        
    }
} Main
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        
        // Your code here!
        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];        
        
        T[0] = 0;
        X[0] = 0;
        Y[0] = 0;
        
        for(int i = 1 ; i < N + 1 ; i++){
            T[i] = sc.nextInt();
            X[i] = sc.nextInt();
            Y[i] = sc.nextInt();
        }
        
        for(int i = N  ; i > 0 ; i--){
            int needT = T[i] - T[i - 1];
            int needP = Math.abs(X[i] - X[i - 1]) + Math.abs(Y[i] - Y[i - 1]);
            //時間が余っていなければアウト
            if(needT < needP){
                break;
            }
            //つぶせる時間は偶数である
            if((needT - needP) % 2 == 1){
                break;
            }
            System.out.println("Yes");
            return;
            
        }
        System.out.println("No");
        
    }
}
