write a go solution for F. Minimize Fixed Pointstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputCall a permutation^∗ p of length n good if gcd(p_i,i)^† >1 for all 2<=i<=n. Find a good permutation with the minimum number of fixed points^‡ across all good permutations of length n. If there are multiple such permutations, print any of them.^∗ A permutation of length n is an array that contains every integer from 1 to n exactly once, in any order. ^†gcd(x,y) denotes the greatest common divisor (GCD) of x and y.^‡A fixed point of a permutation p is an index j (1<=j<=n) such that p_j=j.InputThe first line contains an integer t (1<=qt<=q10^4)  — the number of test cases.The only line of each test case contains an integer n (2<=n<=10^5) — the length of the permutation.It is guaranteed that the sum of n over all test cases does not exceed 10^5. OutputFor each test case, output on a single line an example of a good permutation of length n with the minimum number of fixed points.ExampleInput423613Output1 2
1 2 3
1 4 6 2 5 3
1 12 9 6 10 8 7 4 3 5 11 2 13NoteIn the third sample, we construct the permutation ip_igcd(p_i,i)111242363422555633 Then we see that gcd(p_i,i)>1 for all 2<=i<=6. Furthermore, we see that there are only two fixed points, namely, 1 and 5. It can be shown that it is impossible to build a good permutation of length 6 with fewer fixed points.. Output only the code with no comments, explanation, or additional text.