You are given two arrays A and B,each of size 'N' .Lets say X= all the Count of different pairs of Ai and Bj, such that (Ai xor Bj) is present in any of the Two arrays.
Now, If X is even , Print "Yes" else Print "No".
Note: Use fast I/O as there is very large Testcase file.
First Line contains an integer 'T'- which denotes the number of test cases.
Each line of the testcase contains, an integer -'N', and then N space separed Non negative Integers.
For each Test case, Print Yes or no.
10^6<=Ai, Bi <=10^12
1 5 7
2 4 8
Out of all these xors, 5,7,1,5 are present...so X=4 which is even....Hence Output: Yes
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.