Interesting Binary (Easy Version)

You are given an array $A$ of length $N$. Initially, each element of $A$ is either $0$ or $1$ (that is, $A_i \in \{0, 1\}$). In one operation, you may increase any element $A_i$ $(1 \le i \le N)$ by $1$, and you may perform such operations any number of times, including zero. Your goal is to make the array **adjacent-distinct**, i.e. $$ A_i \ne A_{i+1} \text{ for all } 1 \le i < N. $$ Find th