Once upon a time in the small binary world of "Bitville," there lived two friends named Zero and One. These two friends were binary strings themselves, with Zero representing $"0"$ and One representing $"1."$ One day, they received a special mission from the Binary Council. They were given a binary string, which they called "Binario," and were tasked with balancing it$.$ Binario was in a state of chaos, filled with Os and $1$s$,$ and it desperately needed balance. Zero and One had to perform a unique operation to make Binario balanced. The operation they could perform involved choosing two characters in Binario and swapping them. However, this was no easy task, as Binario had to meet a very specific criterion to be considered balanced. It needed to have the same number of subsequences $"01"$ as the number of subsequences $"10".0$ and $1$ were determined to accomplish this mission and bring harmony to Binario. They knew that with their combined binary wisdom, they could make it happen. So$,$ the question they pondered was: "How many minimum swap operations should they perform to achieve this balance in Binario?" Can you help them find the answer? Input The only line contains the strings $(3<|$s$|100)$ consisting of characters $0$ and$/$or $1.$ Additional constraint on the input: the string s can be made balanced. Output Print a single integer $-$ the minimum number of swap operations to make the string s balanced. Example: Input: $11010$ Output: $1$ In this testcase, one of the possible answers is the following one: $1101001110.$ After that, the number of both $01$ and $10$ is equal to $3.$Write code