But there are a few equations, for which most ordinary wizards failed to
give
distinct solutions. Only the oldest and wisest wizards tried to be
clever and bubbled something about multiplicity of roots - but nobody can
possibly understand such excuses for finding fewer than
distinct roots.
Given a polynomial of degree , find out if wizards can possibly find distinct roots (including the magic ones using ), or if it is impossible -- even for the wizards -- to find distinct roots.
Input
Input starts with the number of test cases
(
) in a single line.
Each test case consists of a single line that holds a series of integers (separated by single spaces).
The first integer is the degree
(
) of the polynomial in
question. It is followed by the
coefficients
(
,
) to form the equation
.
Output
For each test case output ``Yes!'' on a single line (without the quotes) if the wizards have
a chance (provided they are as good as they claim) to find
distinct
roots.
Print ``No!'' on a single line (again without quotes) if there is no way any wizard can possibly find
distinct roots.
Sample Input
Sample Output