You are given a $0$ indexed integer array nums. In one operation, you can:

• Choose two distinct indices i and j in a subarray.

• Choose a non negative integer k such that the $k^{ {th}}$ bit in the binary representation of both nums[i] and nums[j] is $1$.

• Subtract $2^k$ from both nums[i] and nums[j].

A subarray is defined as beautiful if all of its elements can be transformed to $0$ after applying this operation any number of times.

Return the total number of beautiful subarrays in nums.

Note: A subarray is a contiguous non empty sequence of elements within an array.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.