SP1536 BLUEEQ3 - Help Blue Mary Please! (Act III)

N/A

Ten test cases(given one after another,you have to process all!)For each test case, the first line is a single integer n(n

For each test case you should output one line contains n numbers separated by spaces, which is a permutation of integer numbers 0 to n-1.Number x is on the k-th position iff x is replaced by the kth capital latin character.There is one and only one solution for each test case.