Given an array **A** of **n** integers, the task is to count the number of ways to split given array elements into two disjoint groups such that XOR of elements of each group is equal.

**Input:**

The first line of the input contains a single integer **T**, denoting the number of test cases. Then **T** test cases follow. Each test-case has two lines of the input, the first line contains an integer denoting the size of an array N and the second line of input contains N positive integers .

**Output:**

For each testcase, print no. of ways to split an array in a separate line.

**Constraints:**

1<=T<=100

1<=N<=100

1<=arr<=100

**Example:**

**Input:**

2

3

1 2 3

4

5 2 3 2

**Output:**

3

0

Explanation:

Testcase 1: {(1), (2, 3)}, {(2), (1, 3)}, {(3), (1, 2)} are three ways with equal XOR value of two

groups.

Testcase 2: Not possible

Author: Sahil_Chhabra

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.

hardikJain5 | 258 |

CodeBuddy | 250 |

bhatabhi554 | 232 |

Akkki111 | 197 |

clone | 174 |

KshatriyaYash | 1932 |

nikhil_sojan | 1374 |

lonecoder | 1236 |

SumitSingh27 | 1127 |

mazumderrohit8 | 1124 |

blackshadows | 5327 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4591 |

Quandray | 4444 |

Login to report an issue on this page.