Charan’s array problem

import sys

def solve():
    n = int(sys.stdin.readline())
    B = list(map(int, sys.stdin.readline().split()))

    def possible(start):
        A = [0] * n
        A[0] = start
        for i in range(n - 1):
            A[i+1] = A[i] ^ B[i]
        return (A[-1] ^ A[0]) == B[-1]

    if possible(0) or possible(1):
        print("YES")
    else:
        print("NO")

t = int(sys.stdin.readline())
for _ in range(t):
    solve()