You and a friend are playing a game called the Nim Game with a heap of stones. The rules are as follows:

• There is a single heap containing n stones.

• You and your friend take alternating turns, with you going first.

• On each turn, the current player must remove between $1$ and $3$ stones (inclusive) from the heap.

• The player who removes the last stone wins the game.

Given n, the number of stones in the heap, return TRUE if you can win the game assuming both players play optimally, otherwise return FALSE.

Constraints:

• $1 \leq$ n $\leq 2^{31} - 1$

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.