Distinct Integers

MoEngage gives you an array $A$ of length $N$. You are required to perform **exactly** $(N-1)$ operations on the array. In one operation, you have to pick two indices $i$ and $j$ $(1 \leq i < j \leq N)$ and do the following: - Remove the elements $A_i$ and $A_j$ from array. - Append $|A_i - A_j|$ to the array. Note that, after each operation, the size of the array is reduced by one. Thus, after