Tactical Conversion

You are given a **binary** string $S$ of length $N$, i.e. each character of $S$ is either $0$ or $1$. You would like to convert every character of $S$ into $0$. To achieve this, you can perform the following operation: - Choose an index $i$ $(1 \le i \le N)$ such that $S_i = 1$, and change $S_i$ to $0$. However, there is one restriction: You cannot perform two consecutive operations on adjac