Zero Permutation Score

Chef has an array $A$ of length $N$, initially: $A_1 = A_2 = \cdots = A_N = 0.$ Chef wants to transform this array into a permutation of the integers ${1, 2, \dots, N}$. Chef may perform the following operation any number of times: - Select an index $i$ such that $1 \le i \le N$. - Update the value: $A_i := A_i + 1$. After every operation, compute $Z$ as follows: - $Z$ is the number of indice