For Learners

Limits: 2 sec., 256 MiB

Given three distinct points in the space, determine whether one is equidistant from the other two.

Input

The first line contains one integer \(T\) – the number of tests.

Each test consists of three lines, each with coordinates of a point in the form \((x,y,z)\).

Output

For each test case, print Yes if there is a point equidistant from the other two, No otherwise.

Constraints

\(1 \le T \le 10^{5}\),

\(-10^{5} \le x_{i},y_{i},z_{i} \le 10^{5}\).

Samples