A. SwapSorttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output In this problem your goal is to sort an array consisting of n integers in at most n swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. Swaps are performed consecutively, one after another. Note that in this problem you do not have to minimize the number of swaps — your task is to find any sequence that is no longer than n. Input The first line of the input contains integer n (1≤n≤3000) — the number of array elements
