Sorted Substrings

You have a binary string $S$. You can perform the following operation on $S$: - Select any substring $S_{L \dots R}$ $(1 \le L \le R \le |S|)$ which is **sorted** in **non-decreasing** order and remove it from $S$. (Both the left and right halves are concatenated after performing the operation) For e.g. if $S = 100011000$, we can perform the following operation: $100\underline{011}000 \rightarrow