Sorting the Binary String

A binary string $A$ is called *good* if it can be sorted (in non-decreasing order) using the following operation: - Select an $i$ $(1 \le i \le |A| - 1)$ and swap $A_i$ with $A_{i + 1}$. This operation can be performed on any $i$ **at most** once. For example, $A = 10110$ is *good* because we can perform the following operations: $10110 \xrightarrow{i = 1} 01110 \xrightarrow{i = 4} 01101 \xrigh