Simple, yes or no?

Andrew was given the book entitled King of Infinite Space, which describes the life and work of Donald Coxeter. Coxeter is known for his work on polygons. Out of curiosity, Andrew glanced at this Wikipedia page on polygons. Checking whether a polygon is simple sounded simple to him, but is it?

Input

The input starts with a positive integer N, the number of input cases. The next N lines each contain a single input case. Each input case describes a polygon. The polygon is specified by listing its points (in order). Each point is represented by its x- and y-coordinate, which are integers. For example,

0 0 1 0 1 1 0 1

represents a polygon consisting of the points (0, 0), (1, 0), (1, 1) and (0, 1), that is, a square.

Output

For each input case, one line of output is produced. If the polygon is simple, then the output is "Yes, it is!", otherwise "No :(" should be printed.

Sample input

3
0 0 1 0 1 1 0 1
0 0 1 2 2 0
0 0 1 1 0 1 1 0

Sample output

Yes, it is!
Yes, it is!
No :(