A magician has an array of spells called power, where power[i] represents the damage dealt by the spell at index $i$.

If a spell with damage $x$ is cast, no spell with damage equal to $x - 2$, $x - 1$, $x + 1$, or $x + 2$ can be cast. Each spell in power can be cast at most once.

Return the maximum possible total damage the magician can deal.

Constraints:

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

• $1 \leq$ power[i] $\leq 10^9$

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.