Source file: cyclic.(c|cc|hs|java|pas)
Input file: cyclic.in
A permutation is a sequence of integers which contains each integer from 1 to n exactly once. In this problem we are looking for permutations with special properties:
The input file contains several test cases. Each test case consists of a line containing an integer n, (3 ≤ n ≤ 106), the number of integers in the permutation. Input is terminated by n=0.
For each test case print a permutation of the integers 1 to n which is both antimonotonic and cyclic. In case there are multiple solutions, you may print any one. Separate all integers by whitespace characters.
3 5 10 0
3 1 2 4 5 2 3 1 6 10 2 9 3 5 4 7 1 8