Minimize swaps

You are given a binary string $S$. In one operation, you can pick an index $i$ $(1\le i \lt |S|)$ and swap the characters $S_i$ and $S_{(i+1)}$. Find the **minimum** number of operations required, such that, the decimal representation of the final binary string is **divisible** by $3$. If it is impossible to do so, print $-1$ instead. ### Input - The first line of input will contain a single i