Mex Permutation (Easy)

**This is the easy version of the problem. Here you need to construct any valid permutation $P$. In the hard version, you need to count the number of valid permutations.** **This version is worth $100$ points Division $1$ and unscoreable in other Divisions.** Stack had a permutation $P$ of the integers $[0, N - 1]$. Based on that, he calculated an array $A$ of length $N$ as follows: - $A_i = \t