import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    }

    static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = Integer.parseInt(in.next());
            int preT = 0;
            int preX = 0;
            int preY = 0;

            for (int i = 0; i < N; i++) {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            }

            out.println("Yes");
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    }

    static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = Integer.parseInt(in.next());
            int preT = 0;
            int preX = 0;
            int preY = 0;

            for (int i = 0; i < N; i++) {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            }

            out.println("Yes");
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) C solver = new C(); solver new C() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = Integer.parseInt(in.next());
            int preT = 0;
            int preX = 0;
            int preY = 0;

            for (int i = 0; i < N; i++) {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            }

            out.println("Yes");
        }

    } C public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = Integer.parseInt(in.next());
            int preT = 0;
            int preX = 0;
            int preY = 0;

            for (int i = 0; i < N; i++) {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            }

            out.println("Yes");
        } solve {
            int N = Integer.parseInt(in.next());
            int preT = 0;
            int preX = 0;
            int preY = 0;

            for (int i = 0; i < N; i++) {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            }

            out.println("Yes");
        } int N = Integer.parseInt(in.next()); N Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in int preT = 0; preT 0 int preX = 0; preX 0 int preY = 0; preY 0 for (int i = 0; i < N; i++) {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            } {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            } int postT = Integer.parseInt(in.next()); postT Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in int postX = Integer.parseInt(in.next()); postX Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in int postY = Integer.parseInt(in.next()); postY Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in int dt = postT - preT; dt postT - preT postT preT int dist = Math.abs(postX - preX) + Math.abs(postY - preY); dist Math.abs(postX - preX) + Math.abs(postY - preY) Math.abs(postX - preX) Math.abs Math postX - preX postX preX Math.abs(postY - preY) Math.abs Math postY - preY postY preY if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                } (dt < dist) || (((dist - dt) & 1) != 0) (dt < dist) dt dist (((dist - dt) & 1) != 0) ((dist - dt) & 1) (dist - dt) dist dt 1 0 {
                    out.println("No");
                    return;
                } out.println("No") out.println out "No" return; preT = postT preT postT preX = postX preX postX preY = postY preY postY out.println("Yes") out.println out "Yes" int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    }

    static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = Integer.parseInt(in.next());
            int preT = 0;
            int preX = 0;
            int preY = 0;

            for (int i = 0; i < N; i++) {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            }

            out.println("Yes");
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    }

    static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = Integer.parseInt(in.next());
            int preT = 0;
            int preX = 0;
            int preY = 0;

            for (int i = 0; i < N; i++) {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            }

            out.println("Yes");
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    }

    static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = Integer.parseInt(in.next());
            int preT = 0;
            int preX = 0;
            int preY = 0;

            for (int i = 0; i < N; i++) {
                int postT = Integer.parseInt(in.next());
                int postX = Integer.parseInt(in.next());
                int postY = Integer.parseInt(in.next());

                int dt = postT - preT;
                int dist = Math.abs(postX - preX) + Math.abs(postY - preY);
                if ((dt < dist) || (((dist - dt) & 1) != 0)) {
                    out.println("No");
                    return;
                }

                preT = postT;
                preX = postX;
                preY = postY;
            }

            out.println("Yes");
        }

    }
}

