Binary Mismatch

You have a binary string $S$ of length $N$. You must perform the following operation on the binary string $S$ **exactly once**: - Choose two integers $L$ and $R$ $(1 \le L \le R \le N)$ and invert the [substring](https://en.wikipedia.org/wiki/Substring) $S_{L \dots R}$ (i.e change $1$ to $0$ and change $0$ to $1$). Determine whether you can make the number of zeroes in $S$ equal to number of one