Nim Game

Easy

You are playing Nim: a heap of n stones, players alternate removing 1 to 3 stones, and whoever removes the last stone wins. You move first and both play optimally. Return true if you can win.

Example 1

Input:  n = 4
Output: false

Example 2

Input:  n = 1
Output: true

Example 3

Input:  n = 7
Output: true

Constraints

• 1 <= n <= 2^31 - 1