{"problem":{"name":"Sort","description":{"content":"You are given a permutation $A=(A_1,\\ldots,A_N)$ of $(1,2,\\ldots,N)$.   Transform $A$ into $(1,2,\\ldots,N)$ by performing the following operation between $0$ and $N-1$ times, inclusive: *   Operation","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc350_c"},"statements":[{"statement_type":"Markdown","content":"You are given a permutation $A=(A_1,\\ldots,A_N)$ of $(1,2,\\ldots,N)$.  \nTransform $A$ into $(1,2,\\ldots,N)$ by performing the following operation between $0$ and $N-1$ times, inclusive:\n\n*   Operation: Choose any pair of integers $(i,j)$ such that $1\\leq i < j \\leq N$. Swap the elements at the $i$\\-th and $j$\\-th positions of $A$.\n\nIt can be proved that under the given constraints, it is always possible to transform $A$ into $(1,2,\\ldots,N)$.\n\n## Constraints\n\n*   $2 \\leq N \\leq 2\\times 10^5$\n*   $(A_1,\\ldots,A_N)$ is a permutation of $(1,2,\\ldots,N)$.\n*   All input values are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc350_c","tags":[],"sample_group":[["5\n3 4 1 2 5","2\n1 3\n2 4\n\nThe operations change the sequence as follows:\n\n*   Initially, $A=(3,4,1,2,5)$.\n*   The first operation swaps the first and third elements, making $A=(1,4,3,2,5)$.\n*   The second operation swaps the second and fourth elements, making $A=(1,2,3,4,5)$.\n\nOther outputs such as the following are also considered correct:\n\n4\n2 3\n3 4\n1 2\n2 3"],["4\n1 2 3 4","0"],["3\n3 1 2","2\n1 2\n2 3"]],"created_at":"2026-03-03 11:01:13"}}