Alice and Bob play a game with a numeric string s of even length. Some positions are digits ('0'-'9'), and some are question marks ('?'). Alice and Bob take turns replacing a '?' with any digit ('0'-'9'), with Alice going first.

The game ends when all '?' have been replaced. The resulting string is then split into two halves. Alice wins if the sum of digits in the first half equals the sum of digits in the second half. Bob wins otherwise.

Assuming both play optimally, return true if Alice can force a win, otherwise false.