import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();

        int[] ts = new int[N + 1];
        int[] xs = new int[N + 1];
        int[] ys = new int[N + 1];

        ts[0] = 0;
        xs[0] = 0;
        ys[0] = 0;
        for (int i = 0; i < N; i++) {
            ts[i + 1] = sc.nextInt();
            xs[i + 1] = sc.nextInt();
            ys[i + 1] = sc.nextInt();
        }

        for (int i = 0; i < N; i++) {
            int duration = ts[i + 1] - ts[i];
            int distance = Math.abs(xs[i + 1] - xs[i]) + Math.abs(ys[i + 1] - ys[i]);
            boolean just = (distance == duration);
            boolean ok = (duration > distance && ((duration - distance) % 2 == 0));
            if (!just && !ok) {
                System.out.println("No");
                return;
            }
        }
        System.out.println("Yes");
    }
} import java.util.*; util.* java class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();

        int[] ts = new int[N + 1];
        int[] xs = new int[N + 1];
        int[] ys = new int[N + 1];

        ts[0] = 0;
        xs[0] = 0;
        ys[0] = 0;
        for (int i = 0; i < N; i++) {
            ts[i + 1] = sc.nextInt();
            xs[i + 1] = sc.nextInt();
            ys[i + 1] = sc.nextInt();
        }

        for (int i = 0; i < N; i++) {
            int duration = ts[i + 1] - ts[i];
            int distance = Math.abs(xs[i + 1] - xs[i]) + Math.abs(ys[i + 1] - ys[i]);
            boolean just = (distance == duration);
            boolean ok = (duration > distance && ((duration - distance) % 2 == 0));
            if (!just && !ok) {
                System.out.println("No");
                return;
            }
        }
        System.out.println("Yes");
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();

        int[] ts = new int[N + 1];
        int[] xs = new int[N + 1];
        int[] ys = new int[N + 1];

        ts[0] = 0;
        xs[0] = 0;
        ys[0] = 0;
        for (int i = 0; i < N; i++) {
            ts[i + 1] = sc.nextInt();
            xs[i + 1] = sc.nextInt();
            ys[i + 1] = sc.nextInt();
        }

        for (int i = 0; i < N; i++) {
            int duration = ts[i + 1] - ts[i];
            int distance = Math.abs(xs[i + 1] - xs[i]) + Math.abs(ys[i + 1] - ys[i]);
            boolean just = (distance == duration);
            boolean ok = (duration > distance && ((duration - distance) % 2 == 0));
            if (!just && !ok) {
                System.out.println("No");
                return;
            }
        }
        System.out.println("Yes");
    } main {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();

        int[] ts = new int[N + 1];
        int[] xs = new int[N + 1];
        int[] ys = new int[N + 1];

        ts[0] = 0;
        xs[0] = 0;
        ys[0] = 0;
        for (int i = 0; i < N; i++) {
            ts[i + 1] = sc.nextInt();
            xs[i + 1] = sc.nextInt();
            ys[i + 1] = sc.nextInt();
        }

        for (int i = 0; i < N; i++) {
            int duration = ts[i + 1] - ts[i];
            int distance = Math.abs(xs[i + 1] - xs[i]) + Math.abs(ys[i + 1] - ys[i]);
            boolean just = (distance == duration);
            boolean ok = (duration > distance && ((duration - distance) % 2 == 0));
            if (!just && !ok) {
                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[] ts = new int[N + 1]; ts new int[N + 1] N + 1 N 1 int[] xs = new int[N + 1]; xs new int[N + 1] N + 1 N 1 int[] ys = new int[N + 1]; ys new int[N + 1] N + 1 N 1 ts[0] = 0 ts[0] ts 0 0 xs[0] = 0 xs[0] xs 0 0 ys[0] = 0 ys[0] ys 0 0 for (int i = 0; i < N; i++) {
            ts[i + 1] = sc.nextInt();
            xs[i + 1] = sc.nextInt();
            ys[i + 1] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            ts[i + 1] = sc.nextInt();
            xs[i + 1] = sc.nextInt();
            ys[i + 1] = sc.nextInt();
        } {
            ts[i + 1] = sc.nextInt();
            xs[i + 1] = sc.nextInt();
            ys[i + 1] = sc.nextInt();
        } ts[i + 1] = sc.nextInt() ts[i + 1] ts i + 1 i 1 sc.nextInt() sc.nextInt sc xs[i + 1] = sc.nextInt() xs[i + 1] xs i + 1 i 1 sc.nextInt() sc.nextInt sc ys[i + 1] = sc.nextInt() ys[i + 1] ys i + 1 i 1 sc.nextInt() sc.nextInt sc for (int i = 0; i < N; i++) {
            int duration = ts[i + 1] - ts[i];
            int distance = Math.abs(xs[i + 1] - xs[i]) + Math.abs(ys[i + 1] - ys[i]);
            boolean just = (distance == duration);
            boolean ok = (duration > distance && ((duration - distance) % 2 == 0));
            if (!just && !ok) {
                System.out.println("No");
                return;
            }
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            int duration = ts[i + 1] - ts[i];
            int distance = Math.abs(xs[i + 1] - xs[i]) + Math.abs(ys[i + 1] - ys[i]);
            boolean just = (distance == duration);
            boolean ok = (duration > distance && ((duration - distance) % 2 == 0));
            if (!just && !ok) {
                System.out.println("No");
                return;
            }
        } {
            int duration = ts[i + 1] - ts[i];
            int distance = Math.abs(xs[i + 1] - xs[i]) + Math.abs(ys[i + 1] - ys[i]);
            boolean just = (distance == duration);
            boolean ok = (duration > distance && ((duration - distance) % 2 == 0));
            if (!just && !ok) {
                System.out.println("No");
                return;
            }
        } int duration = ts[i + 1] - ts[i]; duration ts[i + 1] - ts[i] ts[i + 1] ts i + 1 i 1 ts[i] ts i int distance = Math.abs(xs[i + 1] - xs[i]) + Math.abs(ys[i + 1] - ys[i]); distance Math.abs(xs[i + 1] - xs[i]) + Math.abs(ys[i + 1] - ys[i]) Math.abs(xs[i + 1] - xs[i]) Math.abs Math xs[i + 1] - xs[i] xs[i + 1] xs i + 1 i 1 xs[i] xs i Math.abs(ys[i + 1] - ys[i]) Math.abs Math ys[i + 1] - ys[i] ys[i + 1] ys i + 1 i 1 ys[i] ys i boolean just = (distance == duration); just (distance == duration) distance duration boolean ok = (duration > distance && ((duration - distance) % 2 == 0)); ok (duration > distance && ((duration - distance) % 2 == 0)) duration > distance duration distance ((duration - distance) % 2 == 0) (duration - distance) % 2 (duration - distance) duration distance 2 0 if (!just && !ok) {
                System.out.println("No");
                return;
            } !just && !ok !just just !ok ok {
                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
import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();

        int[] ts = new int[N + 1];
        int[] xs = new int[N + 1];
        int[] ys = new int[N + 1];

        ts[0] = 0;
        xs[0] = 0;
        ys[0] = 0;
        for (int i = 0; i < N; i++) {
            ts[i + 1] = sc.nextInt();
            xs[i + 1] = sc.nextInt();
            ys[i + 1] = sc.nextInt();
        }

        for (int i = 0; i < N; i++) {
            int duration = ts[i + 1] - ts[i];
            int distance = Math.abs(xs[i + 1] - xs[i]) + Math.abs(ys[i + 1] - ys[i]);
            boolean just = (distance == duration);
            boolean ok = (duration > distance && ((duration - distance) % 2 == 0));
            if (!just && !ok) {
                System.out.println("No");
                return;
            }
        }
        System.out.println("Yes");
    }
}