Mike and Array

Mike loves to play with numbers when he gets bored. He has a fun problem for you. You are given an array of $N$ Integers $[A_1, A_2, A_3, ... A_n]$. You have to perform following operation exactly $N-1$ times : * Choose 2 elements $(A_i, A_j)$, delete $A_i$ and $A_j$ from the array and add a new element $A_i - A_j$. (1 $\leq$ i $\leq$ N and 1 $\leq$ j $\leq$ N) Perform these operations such tha