Rewards for Math

My high school mathematics teacher was fond of challenging us to find as many distinct solutions of a given polynomial equation. There was a reward for the first pupil to report a correct solution, and a special reward for the pupil who declares that the last value has been reported. A polynomial of degree M has M solutions. Most pupils worked hard to quickly find any solution for the polynomial equation. However the clever ones aimed for solutions with multiplicity larger than one and thus got a shot at the special reward.

Your task is to write a program to check whether a given polynomial of degree M has M distinct, real or

complex, solutions. The average students will greatly appreciate your help.

Input

The input starts with an integer N (1≤N≤100) on a separate line that represents the number of equations to be checked. The description of each equation is given on a single line as a series of integers, which are separated by single blank spaces. The first integer M (0≤M≤10) on each line represents the degree of the polynomial, followed by the M + 1 coefficients a₀, a₁,...a_M (-30≤a_i≤30, a₀≠0)  to form the equation ∑_i=0..M (a_ix^M-i) = 0.

Output

Output consists of a single line for each equation. It will be in one of the following two forms:

Yes! -- when the equation has M distinct solutions.

No! -- when the equation has less than M distinct solutions.

Sample Input

4

2 1 1 1

2 1 2 1

4 1 2 1 2 1

4 1 2 2 2 1

Sample Output

Yes!

No!

Yes!

No!