Flipping Failure

Chef has a binary string $S$ with him and he wants to modify it using the following two types of operations - - Type 1 : Choose any two indices $i$ and $j$ such that $1 \leq i, j \leq |S|$ and swap $S_i$ and $S_j$. This operation costs $1$ rupee and can be performed any number of times. - Type 2 : Choose any prefix of length $i$, where $1 \leq i \leq |S|$, and reverse this prefix of the binary