Nim Game

You and a friend take turns removing 1 to 3 stones from a heap. The player who removes the last stone wins and you move first. Print true if you can win with optimal play, otherwise false.

1 <= n <= 2^31 - 1