You are playing the following Nim Game with your friend:

• Initially, there is a heap of stones on the table.

• You and your friend will alternate taking turns, and?you go first.

• On each turn, the person whose turn it is will remove 1 to 3 stones from the heap.

• The one who removes the last stone is the winner.

Given?n, the number of stones in the heap, return?true?if you can win the game assuming both you and your friend play optimally, otherwise return?false.

?

Example 1:

Input: n = 4Output: falseExplanation: These are the possible outcomes: 1. You remove 1 stone. Your friend removes 3 stones, including the last stone. Your friend wins. 2. You remove 2 stones. Your friend removes 2 stones, including the last stone. Your friend wins. 3. You remove 3 stones. Your friend removes the last stone. Your friend wins. In all outcomes, your friend wins.

Example 2:

Input: n = 1Output: true

Example 3:

Input: n = 2Output: true

Runtime:?0 ms, faster than?100.00%?of?Java?online submissions for?Nim Game.

Memory Usage:?41.1 MB, less than?31.70%?of?Java?online submissions for?Nim Game.

最最簡單的一次代碼了，因?yàn)椴还茉趺醋?，只要?duì)方保證每次跟自己抓的和是4的倍數(shù)，對(duì)方就肯定回贏的，后手贏，