In mathematics, a polynomial is an expression consisting of variables (also called indeterminate) and coefficients, that involves only the operations of addition, subtraction, multiplication, and non-negative integer exponents of variables. For example, .

A polynomial is said to be irreducible if it cannot be factored into two or more non-trivial polynomials with real coefficients.
For example, is irreducible, but is not (since ).

Given a polynomial of degree with integer coefficients: , you need to check whether it is irreducible or not.

The first line of the input gives the number of test cases, .  test cases follow.

For each test case, the first line contains one integers . Next line contains  integer numbers:

For each test case, output "Yes" if it is irreducible, otherwise "No".

2
2
1 -2 1
2
1 0 1

No
Yes