Sorter Prodigy

You are given a permutation $(P_1, P_2, \ldots, P_N)$. In one operation, you can do the following: - Choose any integers $L, R$ with $1 \le L \le R \le N$. Then, swap the maximum and minimum elements in subarray $P[L:R]$. Sort the permutation. You can spend at most $4\cdot 10^6$ operations in total for all test cases from a single input. ### Input - The first line of the input contains a single