Prime Ring
----------

Let n be a positive even number.  Consider the problem of arranging
all of the numbers 1,2,3,...,n in a circle so that the sum of every 
pair of adjacent numbers is prime.

For example, when n=6, one possible arrangement is

   1
 6   4
 5   3
   2

When n=8, one possible arrangement is 

  5 2
 8   1
 3   6
  4 7

Given n, you will list all possible arrangments.  Each arrangement
will be a list, giving the elements in order clockwise, starting
from 1.  For example, the second arrangement above would be listed
as 

1 6 7 4 3 8 5 2

(Thus, the first number in each list should always be 1.)

Input
-----

The input will consist of multiple values of n, with 2 <= n <= 16,
each on a separate line.  The end of the input file will be indicated
by a value of 0.

Output
------

For each value of n, print all of the possible arrangements in
lexicographic order.  See sample output below for the format of your
output.  There is a blank line between each set of arrangements,
but no blank line at the end of the file.


Sample Input 
------------
6
8
0

Sample Output 
-------------
Case 1:
1 4 3 2 5 6
1 6 5 2 3 4

Case 2:
1 2 3 8 5 6 7 4
1 2 5 8 3 4 7 6
1 4 7 6 5 8 3 2
1 6 7 4 3 8 5 2