Untitled

def solution(n , views):
    MOD = 10 ** 9 + 7
    n = len(views)
    result = 0

    for i in range(n - 2):  # Start of the subarray
        for j in range(i + 2, n):  # End of the subarray
            xor_all = views[i + 1]
            xor_first_last = views[i] ^ views[j]

            for k in range(i + 2, j):
                xor_all ^= views[k]

            if xor_all == xor_first_last:
                result += 1

    return result % MOD


if __name__ == '__main__':
    print(solution(4, [0,3,6,5]))
    # print(solution(4, [3,7,4,0]))