292. Nim Game

You were playing the following Nim Game with your friend:there was a heap of stones on the table and each time one of your take Turns to remove 1 to 3 stones. The one who removes, the last stone would be the winner. You'll take the first turn to remove the stones.

Both of you is very clever and has optimal strategies for the game. Write a function to determine whether your can win the game given the number of stones in the heap.

For example, if there is 4 stones in the heap and then you'll never win the Game:no matter 1, 2, or 3 stones you remove, The last stone is always being removed by your friend.

There were n stones, and the two took turns to take out 1, 2 or 3 pieces, who won the last piece of the

Answer:

Class solution (Object):
def canwinnim (self, N):
"""
: Type N:int
: Rtype:bool
"""
If n%4 ==0:
Return False
Else
Return True

292. Nim Game