Make it Divisible

Chef has an array $A$ of length $N$. Since Chef's favorite number is $3$, he wants to make all numbers in the array a multiple of $3$. Chef can do the following operation: - Select any $2$ different indices $i$ and $j$ and increase $A_i$ by $1$ and decrease $A_j$ by $1$. Help Chef find out the minimum number of operations required (or report its not possible) to achieve his objective. ### Inpu