Convert to permutation

You are given an array $A$ of size $N$. In one operation, you can: - Choose an index $i$ $(1\le i \le N)$ and increase $A_i$ by $1$. Find the **minimum** number of operations required to convert the array $A$ into a *permutation* of size $N$. If it is impossible to do so, print $-1$. Note that a *permutation* of size $N$ contains each element from $1$ to $N$ exactly once. ### Input - The first