26330번 - Jumping Frog 다국어

문제

A frog is located at the coordinate (x₁,y₁). He wants to go to the coordinate (x₂,y₂). He will perform one or more jumps to reach his destination. The rule of the jumping is as follows: Suppose the frog is located at the coordinate (x,y); then he can jump to the following four squares:

1. (x+y,y)
2. (x-y,y)
3. (x,y+x)
4. (x,y-x)

Given the coordinates (x₁,y₁) and (x₂,y₂), you need to determine if it is possible for the frog to travel from (x₁,y₁) to (x₂,y₂) through a series of jumps as described.

입력

The first input line contains an integer, n (1 ≤ n ≤ 100), indicating the number of test cases. Each test case consists of four integers (between -1,000,000,000 to +1,000,000,000 inclusive) separated by a single space denoting x₁, y₁, x₂ and y₂, respectively.

출력

For each test case, output 1 if the frog can travel from (x₁,y₁) to (x₂,y₂) through a series of jumps as described or 0 otherwise.

제한

힌트