import java.util.*;

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

    int n = sc.nextInt();
    
    int[] t = new int[n+1];
    int[] x = new int[n+1];
    int[] y = new int[n+1];

    for (int i = 1; i <= n; i++) {
      t[i] = sc.nextInt();
      x[i] = sc.nextInt();
      y[i] = sc.nextInt();
    }

    String ans = "Yes";
    for (int i = 1; i <= n; i++) {
      // 距離と時間の可否チェック
      int dt = t[i] - (i == 1 ? 0 : t[i-1]);
      int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1]));
      dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1]));
      if (dt < dist) {
        ans = "No";
        break;
      }

      // 距離のチェック tが奇数ならxy距離の和も奇数(逆も同じ)
      if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } 
    }

    System.out.println(ans);

  }
  
} 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[] t = new int[n+1];
    int[] x = new int[n+1];
    int[] y = new int[n+1];

    for (int i = 1; i <= n; i++) {
      t[i] = sc.nextInt();
      x[i] = sc.nextInt();
      y[i] = sc.nextInt();
    }

    String ans = "Yes";
    for (int i = 1; i <= n; i++) {
      // 距離と時間の可否チェック
      int dt = t[i] - (i == 1 ? 0 : t[i-1]);
      int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1]));
      dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1]));
      if (dt < dist) {
        ans = "No";
        break;
      }

      // 距離のチェック tが奇数ならxy距離の和も奇数(逆も同じ)
      if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } 
    }

    System.out.println(ans);

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

    int n = sc.nextInt();
    
    int[] t = new int[n+1];
    int[] x = new int[n+1];
    int[] y = new int[n+1];

    for (int i = 1; i <= n; i++) {
      t[i] = sc.nextInt();
      x[i] = sc.nextInt();
      y[i] = sc.nextInt();
    }

    String ans = "Yes";
    for (int i = 1; i <= n; i++) {
      // 距離と時間の可否チェック
      int dt = t[i] - (i == 1 ? 0 : t[i-1]);
      int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1]));
      dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1]));
      if (dt < dist) {
        ans = "No";
        break;
      }

      // 距離のチェック tが奇数ならxy距離の和も奇数(逆も同じ)
      if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } 
    }

    System.out.println(ans);

  } main {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    
    int[] t = new int[n+1];
    int[] x = new int[n+1];
    int[] y = new int[n+1];

    for (int i = 1; i <= n; i++) {
      t[i] = sc.nextInt();
      x[i] = sc.nextInt();
      y[i] = sc.nextInt();
    }

    String ans = "Yes";
    for (int i = 1; i <= n; i++) {
      // 距離と時間の可否チェック
      int dt = t[i] - (i == 1 ? 0 : t[i-1]);
      int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1]));
      dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1]));
      if (dt < dist) {
        ans = "No";
        break;
      }

      // 距離のチェック tが奇数ならxy距離の和も奇数(逆も同じ)
      if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } 
    }

    System.out.println(ans);

  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] t = new int[n+1]; t new int[n+1] n+1 n 1 int[] x = new int[n+1]; x new int[n+1] n+1 n 1 int[] y = new int[n+1]; y new int[n+1] n+1 n 1 for (int i = 1; i <= n; i++) {
      t[i] = sc.nextInt();
      x[i] = sc.nextInt();
      y[i] = sc.nextInt();
    } int i = 1; int i = 1; i 1 i <= n i n i++ i++ i {
      t[i] = sc.nextInt();
      x[i] = sc.nextInt();
      y[i] = sc.nextInt();
    } {
      t[i] = sc.nextInt();
      x[i] = sc.nextInt();
      y[i] = sc.nextInt();
    } t[i] = sc.nextInt() t[i] t i sc.nextInt() sc.nextInt sc x[i] = sc.nextInt() x[i] x i sc.nextInt() sc.nextInt sc y[i] = sc.nextInt() y[i] y i sc.nextInt() sc.nextInt sc String ans = "Yes"; ans "Yes" for (int i = 1; i <= n; i++) {
      // 距離と時間の可否チェック
      int dt = t[i] - (i == 1 ? 0 : t[i-1]);
      int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1]));
      dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1]));
      if (dt < dist) {
        ans = "No";
        break;
      }

      // 距離のチェック tが奇数ならxy距離の和も奇数(逆も同じ)
      if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } 
    } int i = 1; int i = 1; i 1 i <= n i n i++ i++ i {
      // 距離と時間の可否チェック
      int dt = t[i] - (i == 1 ? 0 : t[i-1]);
      int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1]));
      dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1]));
      if (dt < dist) {
        ans = "No";
        break;
      }

      // 距離のチェック tが奇数ならxy距離の和も奇数(逆も同じ)
      if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } 
    } {
      // 距離と時間の可否チェック
      int dt = t[i] - (i == 1 ? 0 : t[i-1]);
      int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1]));
      dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1]));
      if (dt < dist) {
        ans = "No";
        break;
      }

      // 距離のチェック tが奇数ならxy距離の和も奇数(逆も同じ)
      if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } 
    } int dt = t[i] - (i == 1 ? 0 : t[i-1]); dt t[i] - (i == 1 ? 0 : t[i-1]) t[i] t i (i == 1 ? 0 : t[i-1]) i == 1 i 1 0 t[i-1] t i-1 i 1 int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1])); dist Math.abs(x[i] - (i == 1 ? 0 : x[i-1])) Math.abs Math x[i] - (i == 1 ? 0 : x[i-1]) x[i] x i (i == 1 ? 0 : x[i-1]) i == 1 i 1 0 x[i-1] x i-1 i 1 dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1])) dist Math.abs(y[i] - (i == 1 ? 0 : y[i-1])) Math.abs Math y[i] - (i == 1 ? 0 : y[i-1]) y[i] y i (i == 1 ? 0 : y[i-1]) i == 1 i 1 0 y[i-1] y i-1 i 1 if (dt < dist) {
        ans = "No";
        break;
      } dt < dist dt dist {
        ans = "No";
        break;
      } ans = "No" ans "No" break; if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } dt % 2 != dist % 2 dt % 2 dt 2 dist % 2 dist 2 {
        ans = "No";
        break;
      } ans = "No" ans "No" break; System.out.println(ans) System.out.println System.out System System.out ans String[] args args public class Main {
  public static void main (String[] args) {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    
    int[] t = new int[n+1];
    int[] x = new int[n+1];
    int[] y = new int[n+1];

    for (int i = 1; i <= n; i++) {
      t[i] = sc.nextInt();
      x[i] = sc.nextInt();
      y[i] = sc.nextInt();
    }

    String ans = "Yes";
    for (int i = 1; i <= n; i++) {
      // 距離と時間の可否チェック
      int dt = t[i] - (i == 1 ? 0 : t[i-1]);
      int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1]));
      dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1]));
      if (dt < dist) {
        ans = "No";
        break;
      }

      // 距離のチェック tが奇数ならxy距離の和も奇数(逆も同じ)
      if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } 
    }

    System.out.println(ans);

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

    int n = sc.nextInt();
    
    int[] t = new int[n+1];
    int[] x = new int[n+1];
    int[] y = new int[n+1];

    for (int i = 1; i <= n; i++) {
      t[i] = sc.nextInt();
      x[i] = sc.nextInt();
      y[i] = sc.nextInt();
    }

    String ans = "Yes";
    for (int i = 1; i <= n; i++) {
      // 距離と時間の可否チェック
      int dt = t[i] - (i == 1 ? 0 : t[i-1]);
      int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1]));
      dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1]));
      if (dt < dist) {
        ans = "No";
        break;
      }

      // 距離のチェック tが奇数ならxy距離の和も奇数(逆も同じ)
      if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } 
    }

    System.out.println(ans);

  }
  
} Main
import java.util.*;

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

    int n = sc.nextInt();
    
    int[] t = new int[n+1];
    int[] x = new int[n+1];
    int[] y = new int[n+1];

    for (int i = 1; i <= n; i++) {
      t[i] = sc.nextInt();
      x[i] = sc.nextInt();
      y[i] = sc.nextInt();
    }

    String ans = "Yes";
    for (int i = 1; i <= n; i++) {
      // 距離と時間の可否チェック
      int dt = t[i] - (i == 1 ? 0 : t[i-1]);
      int dist = Math.abs(x[i] - (i == 1 ? 0 : x[i-1]));
      dist += Math.abs(y[i] - (i == 1 ? 0 : y[i-1]));
      if (dt < dist) {
        ans = "No";
        break;
      }

      // 距離のチェック tが奇数ならxy距離の和も奇数(逆も同じ)
      if (dt % 2 != dist % 2) {
        ans = "No";
        break;
      } 
    }

    System.out.println(ans);

  }
  
}