B'Baby Ehab is known for his love for a certain operation. He has an array a of length n , and he decided to keep doing the following operation on it: Now he asks you if he can make all elements of the array equal. Since babies like to make your life harder, he requires that you leave at least 2 elements remaining. The first line contains an integer t ( 1 <= t <= 15 ) -- the number of test cases you need to solve. The first line of each test case contains an integers n ( 2 <= n <= 2000 ) -- the number of elements in the array a . The second line contains n space-separated integers a_1 , a_2 , ldots , a_{n} ( 0 <= a_i < 2^{30} ) -- the elements of the array a . If Baby Ehab can make all elements equal while leaving at least 2 elements standing, print "YES". Otherwise, print "NO". In the first sample, he can remove the first 2 elements, 0 and 2 , and replace them by 0 oplus 2=2 . The array will be [2,2] , so all the elements are equal. In the second sample, there 's no way to make all the elements equal. '...