Make everything divisible by 3

Chef has an array $A$ of length $N$. In one operation, Chef can: - Choose any two **distinct** indices $i, j$ $(1\le i, j\le N)$ and change both $A_i$ and $A_j$ to $(A_i + A_j)$. Note that both the elements $A_i$ and $A_j$ are getting replaced by the same value. Find the **minimum** number of operations required by Chef to make all the elements divisible by $3$. It is guaranteed that we can mak