An integer n is strictly palindromic if, for every integer base $b$ from $2$ to n $- 2$ inclusive, the representation of n in base $b$ is palindromic.

Given an integer n, return true if n is strictly palindromic, and false otherwise.

Note: A sequence is palindromic if it reads identically forwards and backwards.

Constraints:

• $4 \leq$ n $\leq 10^5$

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.