You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the winner. You will take the first turn to remove the stones.
Both of you are very clever and have optimal strategies for the game. Write a function to determine whether you can win the game given the number of stones in the heap.
For example, if there are 4 stones in the heap, then you will never win the game: no matter 1, 2, or 3 stones you remove, the last stone will always be removed by your friend.
*** if there are 4 stones, you will never win!!! 大寫加粗！Ｔ茸唷蕾各！
所以你第一步走的話就可以先把石頭總數(shù)除以4的余數(shù)個數(shù)的石頭拿走把还，這樣剩余的石頭就是若干個4個石頭蚁鳖，對手先走的游戲了昏兆，于是你可以always win鸳碧，但是如果石頭總數(shù)可以被4整除各淀，那你就永遠(yuǎn)不會贏懒鉴。
class Solution {
func canWinNim(n: Int) -> Bool {
return n % 4 != 0
}
}
