Nim Game Basics

There are n piles of stones. Two players take turns removing any positive number of stones from a single pile. The player who takes the last stone wins. Determine if the first player has a winning strategy given both play optimally.

Examples
Input: [4,8]
Output: true
Hints

Nim Game Basics

There are `n` piles of stones. Two players take turns removing any positive number of stones from a single pile. The player who takes the last stone wins. Determine if the first player has a winning strategy given both play optimally.