You are given a non-negative integer s.

Consider a three-dimensional array A of dimensions $n \times n \times n$, indexed from $0$ to $n - 1$, where each element at index $(i, j, k)$ is defined as:

A[i][j][k] $= i \times (j \text{ OR } k)$

where OR represents the bitwise OR operator.

Return the maximum integer n such that the total sum of all elements in the array A does not exceed s.

Constraints:

• $0 \leq$ s $\leq 10^{15}$

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.