A set is called a good set if the sum of any two numbers in the set is not a perfect square.

Given a set containing elements, our goal is to partition the set into two non-empty parts and (i.e., and ) such that both parts and in the partition are good sets.
Please determine whether the goal above is achievable for the given set .
It is guaranteed that elements in set are all distisnct.

输入描述:

The first line contains a single integer , representing the number of test cases.
The first line of each test case contains a single integer , representing the number of elements in the set .
The second line of each test case contains  integers , representing the  elements in set .

输出描述:

For each test case, output "YES" if the goal is achievable, and "NO" otherwise.

2
5
1 2 3 4 5
3
6 19 30

YES
NO