Deletion and Difference

You're given an array $A$ of length $N$. You can perform the following operation on it: - Choose two indices $i$ and $j$ ($1 \leq i \lt j \leq |A|$) such that $A_i = A_j$. - Delete both $A_i$ and $A_j$ from $A$, and append $|A_i - A_j|$ to $A$. The length of the array reduces by $1$, and all remaining elements are re-indexed to start from $1$. Find the **minimum** possible length of $A$ after