import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int nt = 0;
        int nx = 0;
        int ny = 0;

        boolean isOk = true;
        for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            long distance = (Math.abs(nx - x) + Math.abs(ny - y));
            if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            }
        }
        System.out.println(isOk?"Yes":"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 nt = 0;
        int nx = 0;
        int ny = 0;

        boolean isOk = true;
        for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            long distance = (Math.abs(nx - x) + Math.abs(ny - y));
            if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            }
        }
        System.out.println(isOk?"Yes":"No");
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int nt = 0;
        int nx = 0;
        int ny = 0;

        boolean isOk = true;
        for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            long distance = (Math.abs(nx - x) + Math.abs(ny - y));
            if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            }
        }
        System.out.println(isOk?"Yes":"No");
    } main {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int nt = 0;
        int nx = 0;
        int ny = 0;

        boolean isOk = true;
        for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            long distance = (Math.abs(nx - x) + Math.abs(ny - y));
            if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            }
        }
        System.out.println(isOk?"Yes":"No");
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int nt = 0; nt 0 int nx = 0; nx 0 int ny = 0; ny 0 boolean isOk = true; isOk true for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            long distance = (Math.abs(nx - x) + Math.abs(ny - y));
            if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            }
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            int t = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            long distance = (Math.abs(nx - x) + Math.abs(ny - y));
            if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            }
        } {
            int t = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            long distance = (Math.abs(nx - x) + Math.abs(ny - y));
            if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            }
        } int t = sc.nextInt(); t sc.nextInt() sc.nextInt sc int x = sc.nextInt(); x sc.nextInt() sc.nextInt sc int y = sc.nextInt(); y sc.nextInt() sc.nextInt sc long distance = (Math.abs(nx - x) + Math.abs(ny - y)); distance (Math.abs(nx - x) + Math.abs(ny - y)) Math.abs(nx - x) Math.abs Math nx - x nx x Math.abs(ny - y) Math.abs Math ny - y ny y if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            } ((t - nt) < distance || ((t - nt) - distance) % 2 != 0) (t - nt) < distance (t - nt) t nt distance ((t - nt) - distance) % 2 != 0 ((t - nt) - distance) % 2 ((t - nt) - distance) (t - nt) t nt distance 2 0 {
                isOk = false;
                break;
            } isOk = false isOk false break; System.out.println(isOk?"Yes":"No") System.out.println System.out System System.out isOk?"Yes":"No" isOk "Yes" "No" String[] args args public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int nt = 0;
        int nx = 0;
        int ny = 0;

        boolean isOk = true;
        for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            long distance = (Math.abs(nx - x) + Math.abs(ny - y));
            if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            }
        }
        System.out.println(isOk?"Yes":"No");
    }
} public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int nt = 0;
        int nx = 0;
        int ny = 0;

        boolean isOk = true;
        for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            long distance = (Math.abs(nx - x) + Math.abs(ny - y));
            if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            }
        }
        System.out.println(isOk?"Yes":"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 nt = 0;
        int nx = 0;
        int ny = 0;

        boolean isOk = true;
        for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            long distance = (Math.abs(nx - x) + Math.abs(ny - y));
            if (((t - nt) < distance || ((t - nt) - distance) % 2 != 0)) {
                isOk = false;
                break;
            }
        }
        System.out.println(isOk?"Yes":"No");
    }
}
