Two players play a game with several piles of coins. On each turn, a player must choose one non-empty pile and remove any positive number of coins from it (possibly all). The player who takes the last coin from the last non-empty pile wins.

Both players play optimally. Given an array piles where piles[i] represents the number of coins in pile i, determine whether the first player can force a win.