Two players play a game with several stacks of chips. On each turn, a player must choose a stack with more than 1 chip and split it into two non-empty stacks whose sizes sum to the original. For example, a stack of 5 chips can be split into (1+4), (2+3), (3+2), or (4+1).

The player who cannot make a move (because all stacks contain exactly 1 chip) loses. Both players play optimally. Given an array stacks where stacks[i] represents the size of stack i, determine whether the first player can force a win.