Minimum Replacement

You are given an array $A$ consisting of $N$ integers. In one operation, you can: - Choose any two indices $i$ and $j$ $(i \neq j)$; - Subtract $min(A_i , A_j)$ from both $A_i$ and $A_j$. Note that $min(A_i , A_j)$ denotes the minimum of $A_i$ and $A_j$. Determine whether you can make **all** the elements of the array equal to **zero** in less than or equal to $N$ operations. If it is possible