Given an integer n, compute the following:

• Convert $n^2$ into its uppercase hexadecimal (base $16$) representation.

• Convert $n^3$ into its uppercase hexatrigesimal (base $36$) representation.

Return the concatenated string of the hexadecimal representation followed by the hexatrigesimal representation.

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.