Help me in solving PERMOR problem

help
,
1

My issue

i am unable to understand what the question is actually asking … can anyone explain it at basic level , although the code did submitted successfully

My code

/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		Scanner sc =new Scanner(System.in);
		int T = sc.nextInt();
		while(T >0){
		    int N = sc.nextInt();
		    while(N>0){
		        System.out.print(N +" ");
		        N--;
		    }
		    System.out.println();
		    
		    T--;
		}
	}
}

Problem Link: PERMOR Problem - CodeChef

2

@cosmickin
question states that u have to print any permutation of size n such that the bitwise or of A[i] is not equals to A[i-1] and A[i-2].
so from some basic observations . U will get it that print the permutation in decreasing order will always holds the condition.