Strange Sort

Chef finally found the great treasure of Spiderland. To unlock the treasure, he must solve a problem. Chef has a *permutation* $A$ of length $N$. His task is obtain a **sorted array** from the given permutation using the following types of operations: - Swap: Select two indices $i$ and $j$ such that $|i - j| \gt 1$ and swap the elements $A_i$ and $A_j$. The cost of this operation is $1$. - Delet