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
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:
n
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
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:
n