Ganesha and primes

CodeChefOpen on judge ↗

I love contests ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case contains a single line containing a single integer $n$ ### Output For each test case: - if answer is possible output $n$ integers in a space-separated manner, a permutation meeting the above requirements! - else print "-1" ### Constraints $$1 \leq T \leq 10

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI