Placing 01 And 10

You have $X$ $01$ strings and $Y$ $10$ strings. You will form a new string $S$ by first rearranging these strings in some order, and then concatenate them in this **rearranged order**. Let $f(S)$ denote the number of indices $i$ such that $1 \le i < |S|$ and $S_i \ne S_{i + 1}$. Find the **minimum possible** value of $f(S)$. ### Input - The first line of input will contain a single integer $T$,