import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int ct, cx, cy;
        ct = cx = cy = 0;
        int t, x, y;
        boolean possible = true;
        for (int i = 0; i < n; i++) {
            t = sc.nextInt();
            x = sc.nextInt();
            y = sc.nextInt();
            int distance = Math.abs(x-cx) + Math.abs(y-cy);
            if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } 
            ct = t;
            cx = x;
            cy = y;
        }
        if (possible) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
} 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 ct, cx, cy;
        ct = cx = cy = 0;
        int t, x, y;
        boolean possible = true;
        for (int i = 0; i < n; i++) {
            t = sc.nextInt();
            x = sc.nextInt();
            y = sc.nextInt();
            int distance = Math.abs(x-cx) + Math.abs(y-cy);
            if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } 
            ct = t;
            cx = x;
            cy = y;
        }
        if (possible) {
            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 ct, cx, cy;
        ct = cx = cy = 0;
        int t, x, y;
        boolean possible = true;
        for (int i = 0; i < n; i++) {
            t = sc.nextInt();
            x = sc.nextInt();
            y = sc.nextInt();
            int distance = Math.abs(x-cx) + Math.abs(y-cy);
            if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } 
            ct = t;
            cx = x;
            cy = y;
        }
        if (possible) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    } main {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int ct, cx, cy;
        ct = cx = cy = 0;
        int t, x, y;
        boolean possible = true;
        for (int i = 0; i < n; i++) {
            t = sc.nextInt();
            x = sc.nextInt();
            y = sc.nextInt();
            int distance = Math.abs(x-cx) + Math.abs(y-cy);
            if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } 
            ct = t;
            cx = x;
            cy = y;
        }
        if (possible) {
            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 ct ct cx cx cy; cy ct = cx = cy = 0 ct cx = cy = 0 cx cy = 0 cy 0 int t t x x y; y boolean possible = true; possible true for (int i = 0; i < n; i++) {
            t = sc.nextInt();
            x = sc.nextInt();
            y = sc.nextInt();
            int distance = Math.abs(x-cx) + Math.abs(y-cy);
            if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } 
            ct = t;
            cx = x;
            cy = y;
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            t = sc.nextInt();
            x = sc.nextInt();
            y = sc.nextInt();
            int distance = Math.abs(x-cx) + Math.abs(y-cy);
            if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } 
            ct = t;
            cx = x;
            cy = y;
        } {
            t = sc.nextInt();
            x = sc.nextInt();
            y = sc.nextInt();
            int distance = Math.abs(x-cx) + Math.abs(y-cy);
            if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } 
            ct = t;
            cx = x;
            cy = y;
        } t = sc.nextInt() t sc.nextInt() sc.nextInt sc x = sc.nextInt() x sc.nextInt() sc.nextInt sc y = sc.nextInt() y sc.nextInt() sc.nextInt sc int distance = Math.abs(x-cx) + Math.abs(y-cy); distance Math.abs(x-cx) + Math.abs(y-cy) Math.abs(x-cx) Math.abs Math x-cx x cx Math.abs(y-cy) Math.abs Math y-cy y cy if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } t-ct < distance || ((t-ct)-distance)%2 == 1 t-ct < distance t-ct t ct distance ((t-ct)-distance)%2 == 1 ((t-ct)-distance)%2 ((t-ct)-distance) (t-ct) t ct distance 2 1 {
                possible = false;
                break;
            } possible = false possible false break; ct = t ct t cx = x cx x cy = y cy y if (possible) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        } possible {
            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 ct, cx, cy;
        ct = cx = cy = 0;
        int t, x, y;
        boolean possible = true;
        for (int i = 0; i < n; i++) {
            t = sc.nextInt();
            x = sc.nextInt();
            y = sc.nextInt();
            int distance = Math.abs(x-cx) + Math.abs(y-cy);
            if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } 
            ct = t;
            cx = x;
            cy = y;
        }
        if (possible) {
            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 ct, cx, cy;
        ct = cx = cy = 0;
        int t, x, y;
        boolean possible = true;
        for (int i = 0; i < n; i++) {
            t = sc.nextInt();
            x = sc.nextInt();
            y = sc.nextInt();
            int distance = Math.abs(x-cx) + Math.abs(y-cy);
            if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } 
            ct = t;
            cx = x;
            cy = y;
        }
        if (possible) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
} Main
import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int ct, cx, cy;
        ct = cx = cy = 0;
        int t, x, y;
        boolean possible = true;
        for (int i = 0; i < n; i++) {
            t = sc.nextInt();
            x = sc.nextInt();
            y = sc.nextInt();
            int distance = Math.abs(x-cx) + Math.abs(y-cy);
            if (t-ct < distance || ((t-ct)-distance)%2 == 1) {
                possible = false;
                break;
            } 
            ct = t;
            cx = x;
            cy = y;
        }
        if (possible) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}