One To Three

You are given an array $A$ of length $N$. Each $A_i$ equals $1, 2, $ or $3$. You can perform the following operation on $A$: - Choose an index $i$ ($1 \lt i \lt N$) such that $A_{i-1} + A_{i+1} = 4$. - Then, replace $A_i$ with $4 - A_i$. You may perform this operation however many times you like (including zero). Find the **minimum** possible sum of $A$ in the end. ### Input - The first lin