B'Calin has n buckets, the i -th of which contains a_i wooden squares of side length 1 . Can Calin build a square using all the given squares? The first line contains a single integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. The first line of each test case contains a single integer n ( 1 <= q n <= q 2 cdot 10^5 ) -- the number of buckets. The second line of each test case contains n integers a_1, ldots, a_n ( 1 <= q a_i <= q 10^9 ) -- the number of squares in each bucket. The sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, output "YES" if Calin can build a square using all of the given 1 x 1 squares, and "NO" otherwise. You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer). In the first test case, Calin can build a 3 x 3 square. In the second test case, Calin can build a 4 x 4 square. In the third test case, Calin cannot build a square using all the given squares. '...