Nim Game

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.

中文：你和你的朋友玩下面的NIM游戏：在桌上的一堆石头，每一次你轮流取出1到3块石头。移除最后一块石头的人将是赢家。你将采取第一次把石头移除。
你们两个都很聪明，对游戏有最佳的策略。写一个函数来确定你是否能赢得这场游戏中给定的堆石数。
例如，如果堆中有4块石头，那么你永远不会赢得这场比赛：1，2，或3块石头，你的朋友将永远被删除。

class Solution {
public:
    bool canWinNim(int n) {
        //n除4，能整除就输
        if(n%4 == 0){
            return false;
        }else{
            return true;
        }
    }
};