Circle Game

Alice and Bob play a game on a circle with n positions numbered 0 to n-1 arranged clockwise. A token starts at position 0. On each turn, a player moves the token clockwise by either k or k+1 positions. A position that has been visited cannot be revisited. The player who cannot make a move loses. Both play optimally — determine if Alice (first player) has a winning strategy.

Examples
Input: [5,1]
Output: false
Hints

Circle Game

Alice and Bob play a game on a circle with n positions numbered 0 to n-1 arranged clockwise. A token starts at position 0. On each turn, a player moves the token clockwise by either k or k+1 positions. A position that has been visited cannot be revisited. The player who cannot make a move loses. Both play optimally — determine if Alice (first player) has a winning strategy.