Game With Integers

Two players take turns reducing a positive integer N. In each move, a player must subtract 1, 2, or 3 from the current number. The player who reduces N to exactly 0 wins the game.

Both players play optimally. Given the starting integer N, determine if the first player has a winning strategy. Return true if the first player wins, and false otherwise.

Examples
Input: 1
Output: true
Hints

Game With Integers

Two players take turns reducing a positive integer N. In each move, a player must subtract 1, 2, or 3 from the current number. The player who reduces N to exactly 0 wins the game.