import java.lang.reflect.Array;
import java.util.*;

public class Main {
    class G {
        int x, y , t;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int [][] a = new int[n + 1][3];
        for(int i = 1; i <= n; ++i) {
            a[i][0] = sc.nextInt();
            a[i][1] = sc.nextInt();
            a[i][2] = sc.nextInt();
        }
        a[0][0] = 0;
        a[0][1] = 0;
        a[0][2] = 0;
        boolean ok = true;
        for(int i = 1; i <= n; ++i) {
            int dt = a[i][0] - a[i - 1][0];
            int dx = Math.abs (a[i][1] - a[i - 1][1]);
            int dy = Math.abs (a[i][2] - a[i - 1][2]);
            if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            }
        }
        if(ok)
            System.out.println("Yes");
    }
} import java.lang.reflect.Array; Array java.lang.reflect import java.util.*; util.* java public class Main {
    class G {
        int x, y , t;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int [][] a = new int[n + 1][3];
        for(int i = 1; i <= n; ++i) {
            a[i][0] = sc.nextInt();
            a[i][1] = sc.nextInt();
            a[i][2] = sc.nextInt();
        }
        a[0][0] = 0;
        a[0][1] = 0;
        a[0][2] = 0;
        boolean ok = true;
        for(int i = 1; i <= n; ++i) {
            int dt = a[i][0] - a[i - 1][0];
            int dx = Math.abs (a[i][1] - a[i - 1][1]);
            int dy = Math.abs (a[i][2] - a[i - 1][2]);
            if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            }
        }
        if(ok)
            System.out.println("Yes");
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int [][] a = new int[n + 1][3];
        for(int i = 1; i <= n; ++i) {
            a[i][0] = sc.nextInt();
            a[i][1] = sc.nextInt();
            a[i][2] = sc.nextInt();
        }
        a[0][0] = 0;
        a[0][1] = 0;
        a[0][2] = 0;
        boolean ok = true;
        for(int i = 1; i <= n; ++i) {
            int dt = a[i][0] - a[i - 1][0];
            int dx = Math.abs (a[i][1] - a[i - 1][1]);
            int dy = Math.abs (a[i][2] - a[i - 1][2]);
            if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            }
        }
        if(ok)
            System.out.println("Yes");
    } main {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int [][] a = new int[n + 1][3];
        for(int i = 1; i <= n; ++i) {
            a[i][0] = sc.nextInt();
            a[i][1] = sc.nextInt();
            a[i][2] = sc.nextInt();
        }
        a[0][0] = 0;
        a[0][1] = 0;
        a[0][2] = 0;
        boolean ok = true;
        for(int i = 1; i <= n; ++i) {
            int dt = a[i][0] - a[i - 1][0];
            int dx = Math.abs (a[i][1] - a[i - 1][1]);
            int dy = Math.abs (a[i][2] - a[i - 1][2]);
            if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            }
        }
        if(ok)
            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 [][] a = new int[n + 1][3]; a new int[n + 1][3] n + 1 n 1 3 for(int i = 1; i <= n; ++i) {
            a[i][0] = sc.nextInt();
            a[i][1] = sc.nextInt();
            a[i][2] = sc.nextInt();
        } int i = 1; int i = 1; i 1 i <= n i n ++i ++i i {
            a[i][0] = sc.nextInt();
            a[i][1] = sc.nextInt();
            a[i][2] = sc.nextInt();
        } {
            a[i][0] = sc.nextInt();
            a[i][1] = sc.nextInt();
            a[i][2] = sc.nextInt();
        } a[i][0] = sc.nextInt() a[i][0] a[i] a i 0 sc.nextInt() sc.nextInt sc a[i][1] = sc.nextInt() a[i][1] a[i] a i 1 sc.nextInt() sc.nextInt sc a[i][2] = sc.nextInt() a[i][2] a[i] a i 2 sc.nextInt() sc.nextInt sc a[0][0] = 0 a[0][0] a[0] a 0 0 0 a[0][1] = 0 a[0][1] a[0] a 0 1 0 a[0][2] = 0 a[0][2] a[0] a 0 2 0 boolean ok = true; ok true for(int i = 1; i <= n; ++i) {
            int dt = a[i][0] - a[i - 1][0];
            int dx = Math.abs (a[i][1] - a[i - 1][1]);
            int dy = Math.abs (a[i][2] - a[i - 1][2]);
            if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            }
        } int i = 1; int i = 1; i 1 i <= n i n ++i ++i i {
            int dt = a[i][0] - a[i - 1][0];
            int dx = Math.abs (a[i][1] - a[i - 1][1]);
            int dy = Math.abs (a[i][2] - a[i - 1][2]);
            if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            }
        } {
            int dt = a[i][0] - a[i - 1][0];
            int dx = Math.abs (a[i][1] - a[i - 1][1]);
            int dy = Math.abs (a[i][2] - a[i - 1][2]);
            if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            }
        } int dt = a[i][0] - a[i - 1][0]; dt a[i][0] - a[i - 1][0] a[i][0] a[i] a i 0 a[i - 1][0] a[i - 1] a i - 1 i 1 0 int dx = Math.abs (a[i][1] - a[i - 1][1]); dx Math.abs (a[i][1] - a[i - 1][1]) Math.abs Math a[i][1] - a[i - 1][1] a[i][1] a[i] a i 1 a[i - 1][1] a[i - 1] a i - 1 i 1 1 int dy = Math.abs (a[i][2] - a[i - 1][2]); dy Math.abs (a[i][2] - a[i - 1][2]) Math.abs Math a[i][2] - a[i - 1][2] a[i][2] a[i] a i 2 a[i - 1][2] a[i - 1] a i - 1 i 1 2 if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            } dx + dy > dt || (dt - dx - dy) % 2 != 0 dx + dy > dt dx + dy dx dy dt (dt - dx - dy) % 2 != 0 (dt - dx - dy) % 2 (dt - dx - dy) dt - dx - dy dt dx dy 2 0 {
                ok = false;
                System.out.println("No");
                break;
            } ok = false ok false System.out.println("No") System.out.println System.out System System.out "No" break; if(ok)
            System.out.println("Yes"); ok System.out.println("Yes") System.out.println System.out System System.out "Yes" String[] args args class G {
        int x, y , t;
    } G int x x y y t; t public class Main {
    class G {
        int x, y , t;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int [][] a = new int[n + 1][3];
        for(int i = 1; i <= n; ++i) {
            a[i][0] = sc.nextInt();
            a[i][1] = sc.nextInt();
            a[i][2] = sc.nextInt();
        }
        a[0][0] = 0;
        a[0][1] = 0;
        a[0][2] = 0;
        boolean ok = true;
        for(int i = 1; i <= n; ++i) {
            int dt = a[i][0] - a[i - 1][0];
            int dx = Math.abs (a[i][1] - a[i - 1][1]);
            int dy = Math.abs (a[i][2] - a[i - 1][2]);
            if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            }
        }
        if(ok)
            System.out.println("Yes");
    }
} public class Main {
    class G {
        int x, y , t;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int [][] a = new int[n + 1][3];
        for(int i = 1; i <= n; ++i) {
            a[i][0] = sc.nextInt();
            a[i][1] = sc.nextInt();
            a[i][2] = sc.nextInt();
        }
        a[0][0] = 0;
        a[0][1] = 0;
        a[0][2] = 0;
        boolean ok = true;
        for(int i = 1; i <= n; ++i) {
            int dt = a[i][0] - a[i - 1][0];
            int dx = Math.abs (a[i][1] - a[i - 1][1]);
            int dy = Math.abs (a[i][2] - a[i - 1][2]);
            if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            }
        }
        if(ok)
            System.out.println("Yes");
    }
} Main
import java.lang.reflect.Array;
import java.util.*;

public class Main {
    class G {
        int x, y , t;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int [][] a = new int[n + 1][3];
        for(int i = 1; i <= n; ++i) {
            a[i][0] = sc.nextInt();
            a[i][1] = sc.nextInt();
            a[i][2] = sc.nextInt();
        }
        a[0][0] = 0;
        a[0][1] = 0;
        a[0][2] = 0;
        boolean ok = true;
        for(int i = 1; i <= n; ++i) {
            int dt = a[i][0] - a[i - 1][0];
            int dx = Math.abs (a[i][1] - a[i - 1][1]);
            int dy = Math.abs (a[i][2] - a[i - 1][2]);
            if(dx + dy > dt || (dt - dx - dy) % 2 != 0) {
                ok = false;
                System.out.println("No");
                break;
            }
        }
        if(ok)
            System.out.println("Yes");
    }
}
