"""
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.
"""


def can_win_nim(n):
    """
        If I have 1, 2, 3 stones, I win.
        If I have 4 stones, I cannot win.
        If I have 5 stones, I can win if I remove exactly 1 stone.
        If I have 6 stones, I can win if I remove exactly 2 stones.
        If I have 7 stones, I can win if I remove exactly 3 stones.
        If I have 8 stones, I cannot win.

        Thus, we check if the number of stones is divisible by 4.
    """
    return n % 4 != 0


if __name__ == '__main__':
    print can_win_nim(4)
