CF1148C Crazy Diamond

You are given a permutation $ p $ of integers from $ 1 $ to $ n $ , where $ n $ is an even number. Your goal is to sort the permutation. To do so, you can perform zero or more operations of the following type: - take two indices $ i $ and $ j $ such that $ 2 \cdot |i - j| \geq n $ and swap $ p_i $ and $ p_j $ . There is no need to minimize the number of operations, however you should use no more than $ 5 \cdot n $ operations. One can show that it is always possible to do that.

N/A

N/A

In the first example, when one swap elements on positions $ 1 $ and $ 2 $ , the array becomes sorted. In the second example, pay attention that there is no need to minimize number of swaps. In the third example, after swapping elements on positions $ 1 $ and $ 5 $ the array becomes: $ [4, 5, 3, 1, 2, 6] $ . After swapping elements on positions $ 2 $ and $ 5 $ the array becomes $ [4, 2, 3, 1, 5, 6] $ and finally after swapping elements on positions $ 1 $ and $ 4 $ the array becomes sorted: $ [1, 2, 3, 4, 5, 6] $ .