Two players play a game with a binary string s consisting of '0' and '1' characters. On each turn, a player must remove a non-empty prefix of the remaining string that contains exactly as many '0's as '1's (a balanced prefix). The player who cannot make a move loses.

Both players play optimally. Determine whether the first player can force a win.