human
Count even length subarrays having bitwise XOR equal to 0 | Function to count the number of even - length subarrays having Bitwise XOR equal to 0.
Stores the count of required subarrays.
Stores prefix - XOR of arr [ i , i + 1 , ... N - 1 ].
Traverse the array.
Calculate the prefix - XOR of current subarray.
Check if XOR of the current subarray is 0 and length is even.
Driver Code"
Solution in Python:

Write me a code to count even length subarrays having bitwise XOR equal to 0 and the other steps required?
assistant
#Here is code to count even length subarrays having bitwise XOR equal to 0 and the other steps required.
 def cntSubarr ( arr , N ) :
	res = 0
	prefixXor = 0
	for i in range ( N - 1 ) :
		prefixXor = arr [ i ]
		for j in range ( i + 1 , N ) :
			prefixXor ^= arr [ j ]
			if ( prefixXor == 0 and ( j - i + 1 ) % 2 == 0 ) :
				res += 1
	return res
if __name__ == ' _ _ main _ _ ' :
	arr = [ 2 , 2 , 3 , 3 , 6 , 7 , 8 ]
	N = len ( arr )
	print ( cntSubarr ( arr , N ) )