You are given a positive integer n.

Let even denote the number of even indices with a value of $1$ in the binary representation of n, indexed starting from $0$ at the least significant bit.

Let odd denote the number of odd indices with a value of $1$ in the binary representation of n, indexed starting from $0$ at the least significant bit.

Return an integer array [ even, odd ].

Constraints:

• $1 \leq$ n $\leq 1000$

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.