Nimble Game

Nimble is played on a line of squares numbered 0, 1, 2, ..., n-1. Each square i contains coins[i] coins. A move consists of choosing a square with at least one coin and moving any positive number of coins to any lower-numbered square. Coins moved to square 0 are removed from play. The player who makes the last move wins. Determine if the first player has a winning strategy.

Examples
Input: [0,1,0,2]
Output: true
Hints

Nimble Game

Nimble is played on a line of squares numbered 0, 1, 2, ..., n-1. Each square `i` contains `coins[i]` coins. A move consists of choosing a square with at least one coin and moving any positive number of coins to any lower-numbered square. Coins moved to square 0 are removed from play. The player who makes the last move wins. Determine if the first player has a winning strategy.