For this Question: You are given an array A of even length N consisting of non-negative integers. You need to make each element of the array equal to zero, by doing some number of moves (possibly zero).

In a single move, you can choose two integers l and r such that 1 &le; l &le; r &le; N. Let x = A[l] &oplus; A[l+1] &oplus; A[l+2] ... A[r], where &oplus; represents xor operator. Then, replace the whole subarray with x. In other words, assign A[i] = x for l &le; i &le; r.

Print the minimum number of moves required to make the entire array zero.The first line of the input contains a single integer T – the number of test cases.
Then T test cases follow, each test case in the following format:
The first line contains a single integer N – the length of array A.
The next line contains N space-separated integers representing the elements of the array A.

<b>Constraints:</b>
1&le; T &le; 50
1 &le; N &le; 10<sup>3</sup>
0 &le; A[i] &le; 10<sup>9</sup>
N is even.Output T lines, the i<sup>th</sup> line containing a single integer – the answer to the i<sup>th</sup> test case.Sample Input:
2
2
2 2
4
7 1 2 0

Sample Output:
1
2, I have written this Solution Code: for _ in range(int(input())):
    n=int(input())
    a=list(map(int,input().split()))
    if a.count(0) == n:
        print(0)
    else:
        c= 0
        xor= 0
        for x in a:
            xor ^= x
        if xor == 0:
            print(1)
        else:
            print(2), In this Programming Language: Python, Now tell me if this Code is compilable or not?