String Deletions

You are given a **binary string** $S$ of size $N$, and can perform the following operation on it: - Pick $3$ integers $i, j, k$ such that $1 \le i < j < k \le |S|$ and $S_i \ne S_j, S_j \ne S_k$, then delete $S_j$ from the string (concatenating the parts formed). Find the minimum possible length of the string after performing some number (possibly $0$) of operations on it. ### Input - The first