Problem:
Score : 300 points

Problem Statement

AtCoDeer the deer is going on a trip in a two-dimensional plane.
In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.

If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).
Note that he cannot stay at his place.
Determine whether he can carry out his plan.

Constraints

1 ≤ N ≤ 10^5

0 ≤ x_i ≤ 10^5

0 ≤ y_i ≤ 10^5

1 ≤ t_i ≤ 10^5

t_i < t_{i+1} (1 ≤ i ≤ N-1)

All input values are integers.

Input

Input is given from Standard Input in the following format:

N
t_1 x_1 y_1
t_2 x_2 y_2
:
t_N x_N y_N

Output

If AtCoDeer can carry out his plan, print Yes; if he cannot, print No.

Sample Input 1

2
3 1 2
6 1 1

Sample Output 1

Yes

For example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).

Sample Input 2

1
2 100 100

Sample Output 2

No

It is impossible to be at (100,100) two seconds after being at (0,0).

Sample Input 3

2
5 1 1
100 1 1

Sample Output 3

No

Solution in C# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;

namespace Abc086
{
    class Program
    {
        static void Main(string[] args)
        {
            int N = int.Parse(Console.ReadLine());

            List<int> times = new List<int>();
            List<int> xs = new List<int>();
            List<int> ys = new List<int>();

            for (int i = 0; i < N; i++)
            {
                var rStr = Console.ReadLine();
                times.Add(int.Parse(rStr.Split(' ')[0]));
                xs.Add(int.Parse(rStr.Split(' ')[1]));
                ys.Add(int.Parse(rStr.Split(' ')[2]));
            }

            bool result = true;

            for (int i = 0; i < times.Count(); i++)
            {
                int dt = 0;
                int dd = 0;

                if (i == 0)
                {
                    dt = times[i];
                    dd = Math.Abs(xs[i]) + Math.Abs(ys[i]);
                }
                else
                {
                    dt = times[i] - times[i - 1];
                    dd = Math.Abs(xs[i] - xs[i - 1]) + Math.Abs(ys[i] - ys[i - 1]);
                }

                if (dt < dd)
                {
                    result = false;
                    break;
                }

                if (dt % 2 != dd % 2)
                {
                    result = false;
                    break;
                }

            }

            if (result)
            {
                Console.WriteLine("Yes");
            }
            else
            {
                Console.WriteLine("No");
            }
        }
    }
}