Saurabh loves numbers a lot. He has a board which has all the infinitely many natural numbers written on it. (The board is big enough to contain all the infinitely many natural numbers that can possibly exist!!)

Deepjoy (one of his mischievous friends) tries to manipulate the numbers written on the board using a magic function $F(x)$ and a set $S$.

The details of the magic function and the set are given below:

• The set $S$ contains $n$ elements.
• $F^k(x)=x$ for all $k$ belonging to the set $S$.
• $x$ belongs to the set of natural numbers.
• All elements of the set $S$ satisfy the magic function. (i.e. $F^m(x)=x$, where $m$ is any natural number in the set $S$)

Here $F^k(x) = F(F(F(..F(x))))$, where $F$ is repeated $k$ times.

Now Deepjoy gives the magic function $F(x)$ and a set $S$ containing $n$ elements to Saurabh and asks him to rub all the numbers $m$ which satisfy the magic function (i.e. $F^m(x)=x$, where $m$ is any natural number). Now he asks Saurabh to count the remaining numbers left on the board!

Saurabh is confused whether he would be able to count the remaining numbers left on the board or not. (remember infinitely many natural numbers were written on the board)!

Help him to count the numbers that are left on the board (if you can)!

Input: 

• First line: A single integer $T$ denoting the number of test cases
• Each test case contains the following lines:
  • $1st$ line: $N$, the no. of elements in the set $S$
  • $N$ lines follow denoting the elements of the set $S$

Output:

Print "Yes, I can" if the no. of remaining elements are countable (finite no. of elements are left on the board) otherwise print "No, I can't" in a single line. (ignore the quotes while printing the answer)

Constraints:

$1 \le T \le 10^3$

$1 \le N \le 10^3$

$1 \le$ Elements in the set $S \le 3*10^{18}$