Two players play a game with several boxes of chocolates. Each box contains some number of chocolates. On each turn, a player must choose a non-empty box and eat any positive number of chocolates from it (possibly all). The player who eats the last chocolate from the last non-empty box wins.

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