You are given a string s of only '+' and '-' characters. In each move, you can replace two consecutive '-' characters with '--'. The player who cannot make a move loses.

Given string s, return true if the first player can win assuming both play optimally.