Swap Round Sorting

You are given an array containing a permutation of numbers 1,2,\dots,n, and your task is to sort the array using swap rounds. On each swap round, you can choose any number of distinct pairs of elements and swap each pair. Your task is to find the minimum number of rounds and show how you can choose the pairs in each round. Input The first input line has an integer n: the size of the array. The