Binary Flip

You are given a binary string $S$ of length $N$. Define: - $cnt_{00}$ = the number of substrings `00` in $S$. - $cnt_{11}$ = the number of substrings `11` in $S$. In one **flip**, you may choose any index $i$ and toggle $S_i$ (`0` becomes `1`, `1` becomes `0`). Your task is to determine the **minimum number of flips** required to make $cnt_{11} \ge cnt_{00}$. ### Input - The first line of inpu