Delete Not Equal

Given a binary string $S$, we can perform the following operation as many times as we want: - Choose $i$ such that $1 \le i < |S|$ and $S_i \ne S_{i + 1}$, and either delete $S_i$ or $S_{i + 1}$ from the string (concatenate the remaining parts of the string). Find the minimum final length of the string $S$ after performing some (possibly $0$) number of operations. ### Input - The first line of