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.

Example:

Input: 4
Output: false 
Explanation: 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.

如果个数可以被4整除，那么不管你翻了几个石头，对手都可以翻4减去你翻石头的个数，这样对手永远拿走最后剩下的石头并胜利，如果不可以整除，你可以使用类似的策略，从而胜利

class Solution {
    public boolean canWinNim(int n) {
        return n % 4 != 0;
    }
}